./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_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_JEN_nondet_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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:49:39,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:49:39,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:49:39,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:49:39,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:49:39,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:49:39,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:49:39,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:49:39,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:49:39,356 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:49:39,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:49:39,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:49:39,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:49:39,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:49:39,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:49:39,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:49:39,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:49:39,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:49:39,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:49:39,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:49:39,360 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:49:39,361 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:49:39,361 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:49:39,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:49:39,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:49:39,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:49:39,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:49:39,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:49:39,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:49:39,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:49:39,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:49:39,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:49:39,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:49:39,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:49:39,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:49:39,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:49:39,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:49:39,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:49:39,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:49:39,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:49:39,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:49:39,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:49:39,368 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-17 02:49:39,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:49:39,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:49:39,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:49:39,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:49:39,670 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:49:39,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2024-11-17 02:49:41,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:49:41,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:49:41,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2024-11-17 02:49:41,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b455580e6/9d22d47d8c34428bbad672ba6d2ddbcc/FLAGb8c450da9 [2024-11-17 02:49:41,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b455580e6/9d22d47d8c34428bbad672ba6d2ddbcc [2024-11-17 02:49:41,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:49:41,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:49:41,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:49:41,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:49:41,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:49:41,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:49:41" (1/1) ... [2024-11-17 02:49:41,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3769866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:41, skipping insertion in model container [2024-11-17 02:49:41,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:49:41" (1/1) ... [2024-11-17 02:49:41,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:49:42,235 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:49:42,277 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:49:42,283 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:49:42,290 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:49:42,300 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:49:42,333 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:49:42,335 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:49:42,338 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:49:42,338 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:49:42,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:49:42,364 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:49:42,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:49:42,495 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:49:42,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42 WrapperNode [2024-11-17 02:49:42,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:49:42,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:49:42,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:49:42,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:49:42,505 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:49:42" (1/1) ... [2024-11-17 02:49:42,544 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:49:42" (1/1) ... [2024-11-17 02:49:42,610 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-17 02:49:42,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:49:42,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:49:42,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:49:42,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:49:42,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,704 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-17 02:49:42,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:49:42,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:49:42,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:49:42,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:49:42,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (1/1) ... [2024-11-17 02:49:42,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:49:42,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:49:42,815 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:49:42,817 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:49:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:49:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:49:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:49:42,870 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:49:42,870 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:49:42,871 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:49:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:49:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:49:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:49:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:49:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:49:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 02:49:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 02:49:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 02:49:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 02:49:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 02:49:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 02:49:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:49:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:49:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:49:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:49:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:49:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 02:49:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 02:49:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 02:49:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:49:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:49:43,105 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:49:43,106 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:49:44,881 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:49:45,000 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-17 02:49:45,000 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:49:45,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:49:45,084 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 02:49:45,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:49:45 BoogieIcfgContainer [2024-11-17 02:49:45,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:49:45,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:49:45,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:49:45,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:49:45,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:49:41" (1/3) ... [2024-11-17 02:49:45,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969052f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:49:45, skipping insertion in model container [2024-11-17 02:49:45,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:49:42" (2/3) ... [2024-11-17 02:49:45,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969052f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:49:45, skipping insertion in model container [2024-11-17 02:49:45,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:49:45" (3/3) ... [2024-11-17 02:49:45,093 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2024-11-17 02:49:45,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:49:45,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-17 02:49:45,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:49:45,216 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;@83a3320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:49:45,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-17 02:49:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 1073 states, 651 states have (on average 1.9831029185867897) internal successors, (1291), 1068 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:49:45,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:45,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:49:45,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:45,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 42419324, now seen corresponding path program 1 times [2024-11-17 02:49:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540604014] [2024-11-17 02:49:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:45,489 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:49:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:45,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540604014] [2024-11-17 02:49:45,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540604014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:45,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:49:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231522011] [2024-11-17 02:49:45,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:45,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:45,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:45,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:45,532 INFO L87 Difference]: Start difference. First operand has 1073 states, 651 states have (on average 1.9831029185867897) internal successors, (1291), 1068 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:49:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:46,264 INFO L93 Difference]: Finished difference Result 1059 states and 1224 transitions. [2024-11-17 02:49:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 02:49:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:46,284 INFO L225 Difference]: With dead ends: 1059 [2024-11-17 02:49:46,284 INFO L226 Difference]: Without dead ends: 1056 [2024-11-17 02:49:46,286 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:49:46,289 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 1103 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:46,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 842 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:49:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-17 02:49:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2024-11-17 02:49:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 651 states have (on average 1.8663594470046083) internal successors, (1215), 1051 states have internal predecessors, (1215), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1221 transitions. [2024-11-17 02:49:46,388 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1221 transitions. Word has length 4 [2024-11-17 02:49:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1221 transitions. [2024-11-17 02:49:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:49:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1221 transitions. [2024-11-17 02:49:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:49:46,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:46,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:49:46,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 02:49:46,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:46,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash 42419325, now seen corresponding path program 1 times [2024-11-17 02:49:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349116163] [2024-11-17 02:49:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:46,501 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:49:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349116163] [2024-11-17 02:49:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349116163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:49:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800438918] [2024-11-17 02:49:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:46,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:46,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:46,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:46,505 INFO L87 Difference]: Start difference. First operand 1056 states and 1221 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:49:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:47,266 INFO L93 Difference]: Finished difference Result 1368 states and 1610 transitions. [2024-11-17 02:49:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:47,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 02:49:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:47,274 INFO L225 Difference]: With dead ends: 1368 [2024-11-17 02:49:47,274 INFO L226 Difference]: Without dead ends: 1368 [2024-11-17 02:49:47,276 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:49:47,277 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 389 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:47,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1827 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:49:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-17 02:49:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1282. [2024-11-17 02:49:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 878 states have (on average 1.8234624145785876) internal successors, (1601), 1277 states have internal predecessors, (1601), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1607 transitions. [2024-11-17 02:49:47,313 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1607 transitions. Word has length 4 [2024-11-17 02:49:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:47,313 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1607 transitions. [2024-11-17 02:49:47,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:49:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1607 transitions. [2024-11-17 02:49:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 02:49:47,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:47,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 02:49:47,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 02:49:47,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:47,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1314957056, now seen corresponding path program 1 times [2024-11-17 02:49:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:47,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993949143] [2024-11-17 02:49:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:47,432 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:49:47,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993949143] [2024-11-17 02:49:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993949143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:47,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641004863] [2024-11-17 02:49:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:47,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:47,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:47,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:47,436 INFO L87 Difference]: Start difference. First operand 1282 states and 1607 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:49:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:48,274 INFO L93 Difference]: Finished difference Result 1370 states and 1611 transitions. [2024-11-17 02:49:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:48,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-17 02:49:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:48,280 INFO L225 Difference]: With dead ends: 1370 [2024-11-17 02:49:48,280 INFO L226 Difference]: Without dead ends: 1367 [2024-11-17 02:49:48,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:48,281 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 390 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:48,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 2582 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:49:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-17 02:49:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1282. [2024-11-17 02:49:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 878 states have (on average 1.8211845102505695) internal successors, (1599), 1277 states have internal predecessors, (1599), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1605 transitions. [2024-11-17 02:49:48,307 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1605 transitions. Word has length 5 [2024-11-17 02:49:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:48,308 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1605 transitions. [2024-11-17 02:49:48,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:49:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1605 transitions. [2024-11-17 02:49:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:49:48,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:48,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 02:49:48,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1586509379, now seen corresponding path program 1 times [2024-11-17 02:49:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960442566] [2024-11-17 02:49:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:48,470 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:49:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960442566] [2024-11-17 02:49:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960442566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:48,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:48,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787795383] [2024-11-17 02:49:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:48,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:49:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:48,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:49:48,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:49:48,473 INFO L87 Difference]: Start difference. First operand 1282 states and 1605 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:49,595 INFO L93 Difference]: Finished difference Result 1356 states and 1595 transitions. [2024-11-17 02:49:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:49:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:49,601 INFO L225 Difference]: With dead ends: 1356 [2024-11-17 02:49:49,601 INFO L226 Difference]: Without dead ends: 1356 [2024-11-17 02:49:49,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:49:49,603 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 3370 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3370 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:49,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3370 Valid, 1065 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:49:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-17 02:49:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1271. [2024-11-17 02:49:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 878 states have (on average 1.8075170842824602) internal successors, (1587), 1266 states have internal predecessors, (1587), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1593 transitions. [2024-11-17 02:49:49,630 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1593 transitions. Word has length 9 [2024-11-17 02:49:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1593 transitions. [2024-11-17 02:49:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:49:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1593 transitions. [2024-11-17 02:49:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:49:49,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:49,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:49,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 02:49:49,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:49,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1937149230, now seen corresponding path program 1 times [2024-11-17 02:49:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273965068] [2024-11-17 02:49:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:49,723 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:49:49,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273965068] [2024-11-17 02:49:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273965068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:49:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476900026] [2024-11-17 02:49:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:49,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:49,725 INFO L87 Difference]: Start difference. First operand 1271 states and 1593 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:50,398 INFO L93 Difference]: Finished difference Result 1309 states and 1548 transitions. [2024-11-17 02:49:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 02:49:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:50,403 INFO L225 Difference]: With dead ends: 1309 [2024-11-17 02:49:50,403 INFO L226 Difference]: Without dead ends: 1309 [2024-11-17 02:49:50,404 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:49:50,405 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 1077 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:50,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1362 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:49:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-11-17 02:49:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1224. [2024-11-17 02:49:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 878 states have (on average 1.753986332574032) internal successors, (1540), 1219 states have internal predecessors, (1540), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1546 transitions. [2024-11-17 02:49:50,426 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1546 transitions. Word has length 10 [2024-11-17 02:49:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:50,426 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1546 transitions. [2024-11-17 02:49:50,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1546 transitions. [2024-11-17 02:49:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:49:50,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:50,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:50,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 02:49:50,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:50,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1937149229, now seen corresponding path program 1 times [2024-11-17 02:49:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933056513] [2024-11-17 02:49:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:50,563 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:49:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933056513] [2024-11-17 02:49:50,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933056513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:50,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:50,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:49:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118509577] [2024-11-17 02:49:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:50,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:50,566 INFO L87 Difference]: Start difference. First operand 1224 states and 1546 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:51,246 INFO L93 Difference]: Finished difference Result 1518 states and 1916 transitions. [2024-11-17 02:49:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 02:49:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:51,252 INFO L225 Difference]: With dead ends: 1518 [2024-11-17 02:49:51,253 INFO L226 Difference]: Without dead ends: 1518 [2024-11-17 02:49:51,253 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:49:51,256 INFO L432 NwaCegarLoop]: 1210 mSDtfsCounter, 866 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:51,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1615 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:49:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-17 02:49:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1199. [2024-11-17 02:49:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 878 states have (on average 1.7255125284738042) internal successors, (1515), 1194 states have internal predecessors, (1515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1521 transitions. [2024-11-17 02:49:51,280 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1521 transitions. Word has length 10 [2024-11-17 02:49:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:51,281 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1521 transitions. [2024-11-17 02:49:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1521 transitions. [2024-11-17 02:49:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:49:51,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:51,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 02:49:51,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1136367309, now seen corresponding path program 1 times [2024-11-17 02:49:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988174401] [2024-11-17 02:49:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:51,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988174401] [2024-11-17 02:49:51,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988174401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:51,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:51,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:51,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34244360] [2024-11-17 02:49:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:51,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:51,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:51,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:51,350 INFO L87 Difference]: Start difference. First operand 1199 states and 1521 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:51,990 INFO L93 Difference]: Finished difference Result 1274 states and 1627 transitions. [2024-11-17 02:49:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 02:49:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:51,995 INFO L225 Difference]: With dead ends: 1274 [2024-11-17 02:49:51,995 INFO L226 Difference]: Without dead ends: 1274 [2024-11-17 02:49:51,996 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:49:51,997 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 1301 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:51,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1359 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:49:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-17 02:49:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1176. [2024-11-17 02:49:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 878 states have (on average 1.673120728929385) internal successors, (1469), 1171 states have internal predecessors, (1469), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1475 transitions. [2024-11-17 02:49:52,023 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1475 transitions. Word has length 17 [2024-11-17 02:49:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:52,023 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1475 transitions. [2024-11-17 02:49:52,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1475 transitions. [2024-11-17 02:49:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:49:52,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:52,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:52,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 02:49:52,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1136367308, now seen corresponding path program 1 times [2024-11-17 02:49:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190739059] [2024-11-17 02:49:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:52,078 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:49:52,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:52,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190739059] [2024-11-17 02:49:52,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190739059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:52,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:52,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701577413] [2024-11-17 02:49:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:52,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:52,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:52,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:52,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:52,081 INFO L87 Difference]: Start difference. First operand 1176 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:52,179 INFO L93 Difference]: Finished difference Result 1038 states and 1269 transitions. [2024-11-17 02:49:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:52,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 02:49:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:52,184 INFO L225 Difference]: With dead ends: 1038 [2024-11-17 02:49:52,184 INFO L226 Difference]: Without dead ends: 1038 [2024-11-17 02:49:52,185 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:49:52,185 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 61 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1860 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:49:52,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1860 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-17 02:49:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-11-17 02:49:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 752 states have (on average 1.6795212765957446) internal successors, (1263), 1033 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1269 transitions. [2024-11-17 02:49:52,209 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1269 transitions. Word has length 17 [2024-11-17 02:49:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:52,210 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1269 transitions. [2024-11-17 02:49:52,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1269 transitions. [2024-11-17 02:49:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:49:52,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:52,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:52,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 02:49:52,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1127429641, now seen corresponding path program 1 times [2024-11-17 02:49:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589626370] [2024-11-17 02:49:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:52,300 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:49:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589626370] [2024-11-17 02:49:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589626370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172321536] [2024-11-17 02:49:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:52,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:52,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:52,304 INFO L87 Difference]: Start difference. First operand 1038 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:52,444 INFO L93 Difference]: Finished difference Result 1015 states and 1225 transitions. [2024-11-17 02:49:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:49:52,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 02:49:52,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:52,449 INFO L225 Difference]: With dead ends: 1015 [2024-11-17 02:49:52,449 INFO L226 Difference]: Without dead ends: 1015 [2024-11-17 02:49:52,449 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:49:52,451 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 45 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:52,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2733 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-17 02:49:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2024-11-17 02:49:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 736 states have (on average 1.65625) internal successors, (1219), 1010 states have internal predecessors, (1219), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1225 transitions. [2024-11-17 02:49:52,474 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1225 transitions. Word has length 19 [2024-11-17 02:49:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:52,475 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1225 transitions. [2024-11-17 02:49:52,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1225 transitions. [2024-11-17 02:49:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:49:52,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:52,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:52,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 02:49:52,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:52,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash 979179695, now seen corresponding path program 1 times [2024-11-17 02:49:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:52,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128417144] [2024-11-17 02:49:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:52,557 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:49:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128417144] [2024-11-17 02:49:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128417144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:52,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202082411] [2024-11-17 02:49:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:52,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:52,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:52,562 INFO L87 Difference]: Start difference. First operand 1015 states and 1225 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:49:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:53,263 INFO L93 Difference]: Finished difference Result 1084 states and 1280 transitions. [2024-11-17 02:49:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-17 02:49:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:53,268 INFO L225 Difference]: With dead ends: 1084 [2024-11-17 02:49:53,268 INFO L226 Difference]: Without dead ends: 1084 [2024-11-17 02:49:53,268 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:49:53,269 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 1188 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:53,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 1616 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:49:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-17 02:49:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 992. [2024-11-17 02:49:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 736 states have (on average 1.625) internal successors, (1196), 987 states have internal predecessors, (1196), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1202 transitions. [2024-11-17 02:49:53,287 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1202 transitions. Word has length 21 [2024-11-17 02:49:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:53,288 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1202 transitions. [2024-11-17 02:49:53,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:49:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1202 transitions. [2024-11-17 02:49:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:49:53,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:53,289 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] [2024-11-17 02:49:53,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 02:49:53,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:53,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 979179696, now seen corresponding path program 1 times [2024-11-17 02:49:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:53,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692309248] [2024-11-17 02:49:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:53,361 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:49:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692309248] [2024-11-17 02:49:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692309248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:53,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122987515] [2024-11-17 02:49:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:53,364 INFO L87 Difference]: Start difference. First operand 992 states and 1202 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:49:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:53,424 INFO L93 Difference]: Finished difference Result 917 states and 1099 transitions. [2024-11-17 02:49:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:53,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-17 02:49:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:53,428 INFO L225 Difference]: With dead ends: 917 [2024-11-17 02:49:53,429 INFO L226 Difference]: Without dead ends: 917 [2024-11-17 02:49:53,429 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:49:53,430 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 61 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:53,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1570 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-17 02:49:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2024-11-17 02:49:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 673 states have (on average 1.62407132243685) internal successors, (1093), 912 states have internal predecessors, (1093), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1099 transitions. [2024-11-17 02:49:53,446 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1099 transitions. Word has length 21 [2024-11-17 02:49:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:53,449 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1099 transitions. [2024-11-17 02:49:53,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:49:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1099 transitions. [2024-11-17 02:49:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 02:49:53,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:53,450 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] [2024-11-17 02:49:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 02:49:53,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 393737715, now seen corresponding path program 1 times [2024-11-17 02:49:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38327609] [2024-11-17 02:49:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:53,516 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:49:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38327609] [2024-11-17 02:49:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38327609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:53,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296314903] [2024-11-17 02:49:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:53,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:53,520 INFO L87 Difference]: Start difference. First operand 917 states and 1099 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:49:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:53,617 INFO L93 Difference]: Finished difference Result 902 states and 1077 transitions. [2024-11-17 02:49:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:49:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-17 02:49:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:53,641 INFO L225 Difference]: With dead ends: 902 [2024-11-17 02:49:53,642 INFO L226 Difference]: Without dead ends: 902 [2024-11-17 02:49:53,643 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:49:53,643 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 45 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:53,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2298 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-17 02:49:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-11-17 02:49:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 665 states have (on average 1.6105263157894736) internal successors, (1071), 897 states have internal predecessors, (1071), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:49:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1077 transitions. [2024-11-17 02:49:53,658 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1077 transitions. Word has length 23 [2024-11-17 02:49:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:53,659 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1077 transitions. [2024-11-17 02:49:53,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:49:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1077 transitions. [2024-11-17 02:49:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 02:49:53,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:53,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:53,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 02:49:53,661 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:53,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash -120478259, now seen corresponding path program 1 times [2024-11-17 02:49:53,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:53,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044466459] [2024-11-17 02:49:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:49:53,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:53,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044466459] [2024-11-17 02:49:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044466459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:53,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455874646] [2024-11-17 02:49:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:53,796 INFO L87 Difference]: Start difference. First operand 902 states and 1077 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:54,563 INFO L93 Difference]: Finished difference Result 1493 states and 1799 transitions. [2024-11-17 02:49:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-17 02:49:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:54,570 INFO L225 Difference]: With dead ends: 1493 [2024-11-17 02:49:54,570 INFO L226 Difference]: Without dead ends: 1493 [2024-11-17 02:49:54,570 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:49:54,571 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 711 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:54,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1605 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:49:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2024-11-17 02:49:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1271. [2024-11-17 02:49:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1034 states have (on average 1.574468085106383) internal successors, (1628), 1264 states have internal predecessors, (1628), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1638 transitions. [2024-11-17 02:49:54,600 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1638 transitions. Word has length 33 [2024-11-17 02:49:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:54,601 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1638 transitions. [2024-11-17 02:49:54,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1638 transitions. [2024-11-17 02:49:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:49:54,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:54,602 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] [2024-11-17 02:49:54,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 02:49:54,602 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2142324407, now seen corresponding path program 1 times [2024-11-17 02:49:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532346412] [2024-11-17 02:49:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:54,787 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:49:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532346412] [2024-11-17 02:49:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532346412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378177457] [2024-11-17 02:49:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:54,789 INFO L87 Difference]: Start difference. First operand 1271 states and 1638 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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:49:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:55,351 INFO L93 Difference]: Finished difference Result 1571 states and 2029 transitions. [2024-11-17 02:49:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:49:55,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-17 02:49:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:55,358 INFO L225 Difference]: With dead ends: 1571 [2024-11-17 02:49:55,359 INFO L226 Difference]: Without dead ends: 1571 [2024-11-17 02:49:55,359 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:49:55,360 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 713 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:55,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1778 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:49:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-11-17 02:49:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1267. [2024-11-17 02:49:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1034 states have (on average 1.5667311411992264) internal successors, (1620), 1260 states have internal predecessors, (1620), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1630 transitions. [2024-11-17 02:49:55,383 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1630 transitions. Word has length 37 [2024-11-17 02:49:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1630 transitions. [2024-11-17 02:49:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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:49:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1630 transitions. [2024-11-17 02:49:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-17 02:49:55,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:55,390 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] [2024-11-17 02:49:55,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 02:49:55,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:55,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1254026296, now seen corresponding path program 1 times [2024-11-17 02:49:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:55,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440888524] [2024-11-17 02:49:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:55,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:55,501 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:49:55,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440888524] [2024-11-17 02:49:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440888524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359931236] [2024-11-17 02:49:55,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:55,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:55,505 INFO L87 Difference]: Start difference. First operand 1267 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:49:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:55,596 INFO L93 Difference]: Finished difference Result 1249 states and 1600 transitions. [2024-11-17 02:49:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:49:55,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-11-17 02:49:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:55,602 INFO L225 Difference]: With dead ends: 1249 [2024-11-17 02:49:55,602 INFO L226 Difference]: Without dead ends: 1249 [2024-11-17 02:49:55,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:49:55,604 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 27 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:55,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2278 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-17 02:49:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-11-17 02:49:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1016 states have (on average 1.56496062992126) internal successors, (1590), 1242 states have internal predecessors, (1590), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1600 transitions. [2024-11-17 02:49:55,627 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1600 transitions. Word has length 66 [2024-11-17 02:49:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:55,628 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1600 transitions. [2024-11-17 02:49:55,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:49:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1600 transitions. [2024-11-17 02:49:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 02:49:55,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:55,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 02:49:55,629 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:55,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1216220573, now seen corresponding path program 1 times [2024-11-17 02:49:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759901746] [2024-11-17 02:49:55,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:55,734 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:49:55,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:55,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759901746] [2024-11-17 02:49:55,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759901746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:55,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:55,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611633074] [2024-11-17 02:49:55,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:55,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:49:55,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:55,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:49:55,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:49:55,738 INFO L87 Difference]: Start difference. First operand 1249 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:55,828 INFO L93 Difference]: Finished difference Result 1237 states and 1580 transitions. [2024-11-17 02:49:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:49:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-17 02:49:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:55,834 INFO L225 Difference]: With dead ends: 1237 [2024-11-17 02:49:55,834 INFO L226 Difference]: Without dead ends: 1237 [2024-11-17 02:49:55,834 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:49:55,835 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 21 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:55,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2272 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-17 02:49:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1237. [2024-11-17 02:49:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1004 states have (on average 1.5637450199203187) internal successors, (1570), 1230 states have internal predecessors, (1570), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1580 transitions. [2024-11-17 02:49:55,856 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1580 transitions. Word has length 72 [2024-11-17 02:49:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:55,856 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1580 transitions. [2024-11-17 02:49:55,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:49:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1580 transitions. [2024-11-17 02:49:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-17 02:49:55,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:55,859 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] [2024-11-17 02:49:55,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 02:49:55,859 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:55,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash 538661248, now seen corresponding path program 1 times [2024-11-17 02:49:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247288488] [2024-11-17 02:49:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:55,966 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:49:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247288488] [2024-11-17 02:49:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247288488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:49:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572182369] [2024-11-17 02:49:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:55,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:49:55,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:49:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:49:55,969 INFO L87 Difference]: Start difference. First operand 1237 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:49:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:56,081 INFO L93 Difference]: Finished difference Result 1501 states and 1882 transitions. [2024-11-17 02:49:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:49:56,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-11-17 02:49:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:56,087 INFO L225 Difference]: With dead ends: 1501 [2024-11-17 02:49:56,087 INFO L226 Difference]: Without dead ends: 1501 [2024-11-17 02:49:56,088 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:49:56,088 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 201 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:56,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1527 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:49:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-17 02:49:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1490. [2024-11-17 02:49:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1257 states have (on average 1.4852824184566429) internal successors, (1867), 1483 states have internal predecessors, (1867), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1877 transitions. [2024-11-17 02:49:56,114 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1877 transitions. Word has length 74 [2024-11-17 02:49:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:56,114 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1877 transitions. [2024-11-17 02:49:56,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:49:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1877 transitions. [2024-11-17 02:49:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-17 02:49:56,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:56,115 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:49:56,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 02:49:56,115 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1058372448, now seen corresponding path program 1 times [2024-11-17 02:49:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85158135] [2024-11-17 02:49:56,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:56,491 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:49:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85158135] [2024-11-17 02:49:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85158135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 02:49:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898574633] [2024-11-17 02:49:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:49:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:56,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:49:56,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:49:56,495 INFO L87 Difference]: Start difference. First operand 1490 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:49:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:56,705 INFO L93 Difference]: Finished difference Result 2129 states and 2621 transitions. [2024-11-17 02:49:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:49:56,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:49:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:56,711 INFO L225 Difference]: With dead ends: 2129 [2024-11-17 02:49:56,712 INFO L226 Difference]: Without dead ends: 2125 [2024-11-17 02:49:56,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-17 02:49:56,712 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 744 mSDsluCounter, 3041 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 3804 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:56,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 3804 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:49:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-11-17 02:49:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1389. [2024-11-17 02:49:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1156 states have (on average 1.5025951557093427) internal successors, (1737), 1382 states have internal predecessors, (1737), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1747 transitions. [2024-11-17 02:49:56,742 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1747 transitions. Word has length 79 [2024-11-17 02:49:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:56,742 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1747 transitions. [2024-11-17 02:49:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:49:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1747 transitions. [2024-11-17 02:49:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:49:56,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:56,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 02:49:56,747 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1288437414, now seen corresponding path program 1 times [2024-11-17 02:49:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074771085] [2024-11-17 02:49:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:57,015 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:49:57,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:57,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074771085] [2024-11-17 02:49:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074771085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:57,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:57,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085137653] [2024-11-17 02:49:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:57,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:49:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:49:57,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:49:57,018 INFO L87 Difference]: Start difference. First operand 1389 states and 1747 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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:49:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:57,649 INFO L93 Difference]: Finished difference Result 1388 states and 1745 transitions. [2024-11-17 02:49:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:49:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2024-11-17 02:49:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:57,658 INFO L225 Difference]: With dead ends: 1388 [2024-11-17 02:49:57,659 INFO L226 Difference]: Without dead ends: 1388 [2024-11-17 02:49:57,659 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:49:57,659 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 2 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:57,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2260 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:49:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-17 02:49:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2024-11-17 02:49:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1156 states have (on average 1.5008650519031141) internal successors, (1735), 1381 states have internal predecessors, (1735), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1745 transitions. [2024-11-17 02:49:57,682 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1745 transitions. Word has length 88 [2024-11-17 02:49:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:57,683 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1745 transitions. [2024-11-17 02:49:57,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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:49:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1745 transitions. [2024-11-17 02:49:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:49:57,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:57,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:49:57,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 02:49:57,684 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:57,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1288437415, now seen corresponding path program 1 times [2024-11-17 02:49:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:57,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418903350] [2024-11-17 02:49:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:58,104 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:49:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:58,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418903350] [2024-11-17 02:49:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418903350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:58,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:58,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:49:58,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806618461] [2024-11-17 02:49:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:58,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:49:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:58,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:49:58,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:49:58,106 INFO L87 Difference]: Start difference. First operand 1388 states and 1745 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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:49:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:49:58,815 INFO L93 Difference]: Finished difference Result 1387 states and 1743 transitions. [2024-11-17 02:49:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:49:58,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2024-11-17 02:49:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:49:58,820 INFO L225 Difference]: With dead ends: 1387 [2024-11-17 02:49:58,821 INFO L226 Difference]: Without dead ends: 1387 [2024-11-17 02:49:58,821 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:49:58,822 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:49:58,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2222 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:49:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-17 02:49:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1387. [2024-11-17 02:49:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1154 states have (on average 1.501733102253033) internal successors, (1733), 1380 states have internal predecessors, (1733), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:49:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1743 transitions. [2024-11-17 02:49:58,843 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1743 transitions. Word has length 88 [2024-11-17 02:49:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:49:58,844 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1743 transitions. [2024-11-17 02:49:58,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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:49:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1743 transitions. [2024-11-17 02:49:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:49:58,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:49:58,845 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:49:58,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 02:49:58,846 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:49:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:49:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 666727235, now seen corresponding path program 1 times [2024-11-17 02:49:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:49:58,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152304346] [2024-11-17 02:49:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:49:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:49:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:49:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:49:59,171 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:49:59,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:49:59,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152304346] [2024-11-17 02:49:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152304346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:49:59,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:49:59,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:49:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231659048] [2024-11-17 02:49:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:49:59,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:49:59,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:49:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:49:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:49:59,175 INFO L87 Difference]: Start difference. First operand 1387 states and 1743 transitions. Second operand has 7 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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:50:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:00,035 INFO L93 Difference]: Finished difference Result 1405 states and 1769 transitions. [2024-11-17 02:50:00,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:50:00,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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 96 [2024-11-17 02:50:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:00,043 INFO L225 Difference]: With dead ends: 1405 [2024-11-17 02:50:00,044 INFO L226 Difference]: Without dead ends: 1405 [2024-11-17 02:50:00,044 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:50:00,045 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 10 mSDsluCounter, 2728 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3499 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:00,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3499 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:50:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-17 02:50:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1396. [2024-11-17 02:50:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1162 states have (on average 1.5008605851979346) internal successors, (1744), 1387 states have internal predecessors, (1744), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-17 02:50:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1759 transitions. [2024-11-17 02:50:00,081 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1759 transitions. Word has length 96 [2024-11-17 02:50:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:00,084 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1759 transitions. [2024-11-17 02:50:00,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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:50:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1759 transitions. [2024-11-17 02:50:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:50:00,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:00,086 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:50:00,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 02:50:00,086 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash 666727236, now seen corresponding path program 1 times [2024-11-17 02:50:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:00,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488521446] [2024-11-17 02:50:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:00,619 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:50:00,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:00,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488521446] [2024-11-17 02:50:00,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488521446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:00,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:00,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:50:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765130878] [2024-11-17 02:50:00,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:00,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:50:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:00,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:50:00,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:50:00,622 INFO L87 Difference]: Start difference. First operand 1396 states and 1759 transitions. Second operand has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:50:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:01,345 INFO L93 Difference]: Finished difference Result 1396 states and 1757 transitions. [2024-11-17 02:50:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:50:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 96 [2024-11-17 02:50:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:01,356 INFO L225 Difference]: With dead ends: 1396 [2024-11-17 02:50:01,356 INFO L226 Difference]: Without dead ends: 1396 [2024-11-17 02:50:01,356 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:50:01,356 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 5 mSDsluCounter, 2728 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:01,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3503 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:50:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-17 02:50:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1396. [2024-11-17 02:50:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1162 states have (on average 1.4991394148020654) internal successors, (1742), 1387 states have internal predecessors, (1742), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-17 02:50:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1757 transitions. [2024-11-17 02:50:01,390 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1757 transitions. Word has length 96 [2024-11-17 02:50:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:01,391 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1757 transitions. [2024-11-17 02:50:01,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:50:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1757 transitions. [2024-11-17 02:50:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 02:50:01,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:01,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:01,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 02:50:01,407 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:01,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1280361511, now seen corresponding path program 1 times [2024-11-17 02:50:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963254411] [2024-11-17 02:50:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:01,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:01,944 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:50:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963254411] [2024-11-17 02:50:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963254411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:01,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085999316] [2024-11-17 02:50:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:01,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:01,947 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:50:01,948 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:50:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:02,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 02:50:02,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:02,381 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:50:02,381 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:50:02,427 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:50:02,517 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:50:02,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:02,713 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:50:02,761 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:50:02,802 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:50:02,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085999316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:02,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:02,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-17 02:50:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276697455] [2024-11-17 02:50:02,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:02,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:50:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:50:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=319, Unknown=7, NotChecked=0, Total=380 [2024-11-17 02:50:02,879 INFO L87 Difference]: Start difference. First operand 1396 states and 1757 transitions. Second operand has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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:50:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:04,966 INFO L93 Difference]: Finished difference Result 1403 states and 1763 transitions. [2024-11-17 02:50:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:50:04,967 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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 97 [2024-11-17 02:50:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:04,972 INFO L225 Difference]: With dead ends: 1403 [2024-11-17 02:50:04,972 INFO L226 Difference]: Without dead ends: 1403 [2024-11-17 02:50:04,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=505, Unknown=8, NotChecked=0, Total=600 [2024-11-17 02:50:04,973 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 722 mSDsluCounter, 5634 mSDsCounter, 0 mSdLazyCounter, 4305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 6118 SdHoareTripleChecker+Invalid, 4321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:04,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 6118 Invalid, 4321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4305 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:50:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-11-17 02:50:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1400. [2024-11-17 02:50:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1166 states have (on average 1.4965694682675814) internal successors, (1745), 1390 states have internal predecessors, (1745), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1757 transitions. [2024-11-17 02:50:05,012 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1757 transitions. Word has length 97 [2024-11-17 02:50:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:05,013 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 1757 transitions. [2024-11-17 02:50:05,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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:50:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1757 transitions. [2024-11-17 02:50:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 02:50:05,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:05,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:05,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 02:50:05,216 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,SelfDestructingSolverStorable22 [2024-11-17 02:50:05,216 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1280361512, now seen corresponding path program 1 times [2024-11-17 02:50:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032310930] [2024-11-17 02:50:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:05,966 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:50:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032310930] [2024-11-17 02:50:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032310930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192513537] [2024-11-17 02:50:05,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:05,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:05,971 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:50:05,972 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:50:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:06,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 02:50:06,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:06,314 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:50:06,321 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:06,322 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:50:06,349 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:50:06,354 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:50:06,445 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:50:06,451 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:50:06,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:06,554 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:50:06,559 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:50:06,602 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:50:06,609 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:50:06,629 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:50:06,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:06,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192513537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:06,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:06,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-17 02:50:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057417608] [2024-11-17 02:50:06,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:06,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:50:06,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:06,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:50:06,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=390, Unknown=7, NotChecked=0, Total=462 [2024-11-17 02:50:06,777 INFO L87 Difference]: Start difference. First operand 1400 states and 1757 transitions. Second operand has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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:50:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:08,945 INFO L93 Difference]: Finished difference Result 1402 states and 1761 transitions. [2024-11-17 02:50:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:50:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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 97 [2024-11-17 02:50:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:08,949 INFO L225 Difference]: With dead ends: 1402 [2024-11-17 02:50:08,949 INFO L226 Difference]: Without dead ends: 1402 [2024-11-17 02:50:08,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=589, Unknown=7, NotChecked=0, Total=702 [2024-11-17 02:50:08,950 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 727 mSDsluCounter, 4470 mSDsCounter, 0 mSdLazyCounter, 4673 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 4694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:08,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4957 Invalid, 4694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4673 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:50:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-11-17 02:50:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1390. [2024-11-17 02:50:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1158 states have (on average 1.4974093264248705) internal successors, (1734), 1382 states have internal predecessors, (1734), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:50:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1744 transitions. [2024-11-17 02:50:08,968 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1744 transitions. Word has length 97 [2024-11-17 02:50:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:08,969 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1744 transitions. [2024-11-17 02:50:08,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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:50:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1744 transitions. [2024-11-17 02:50:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:50:08,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:08,970 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:50:08,989 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:50:09,171 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,SelfDestructingSolverStorable23 [2024-11-17 02:50:09,171 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1751802444, now seen corresponding path program 1 times [2024-11-17 02:50:09,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672782568] [2024-11-17 02:50:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:09,684 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:50:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672782568] [2024-11-17 02:50:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672782568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:09,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:09,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:50:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085524109] [2024-11-17 02:50:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:09,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:50:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:50:09,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:50:09,687 INFO L87 Difference]: Start difference. First operand 1390 states and 1744 transitions. Second operand has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 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:50:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:11,327 INFO L93 Difference]: Finished difference Result 1409 states and 1769 transitions. [2024-11-17 02:50:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:50:11,328 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 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 99 [2024-11-17 02:50:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:11,333 INFO L225 Difference]: With dead ends: 1409 [2024-11-17 02:50:11,337 INFO L226 Difference]: Without dead ends: 1409 [2024-11-17 02:50:11,337 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:50:11,340 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 724 mSDsluCounter, 4692 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 5176 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:11,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 5176 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:50:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-17 02:50:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1405. [2024-11-17 02:50:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1172 states have (on average 1.4940273037542662) internal successors, (1751), 1395 states have internal predecessors, (1751), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1763 transitions. [2024-11-17 02:50:11,359 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1763 transitions. Word has length 99 [2024-11-17 02:50:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:11,360 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1763 transitions. [2024-11-17 02:50:11,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 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:50:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1763 transitions. [2024-11-17 02:50:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:50:11,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:11,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, 1, 1, 1, 1, 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:50:11,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 02:50:11,362 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:11,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1751802443, now seen corresponding path program 1 times [2024-11-17 02:50:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929412063] [2024-11-17 02:50:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:12,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:12,115 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:50:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929412063] [2024-11-17 02:50:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929412063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:12,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:12,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 02:50:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732364608] [2024-11-17 02:50:12,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:12,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 02:50:12,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:12,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 02:50:12,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-17 02:50:12,118 INFO L87 Difference]: Start difference. First operand 1405 states and 1763 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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:50:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:13,775 INFO L93 Difference]: Finished difference Result 1408 states and 1767 transitions. [2024-11-17 02:50:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 02:50:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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 99 [2024-11-17 02:50:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:13,779 INFO L225 Difference]: With dead ends: 1408 [2024-11-17 02:50:13,779 INFO L226 Difference]: Without dead ends: 1408 [2024-11-17 02:50:13,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:50:13,780 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 741 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:13,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 3768 Invalid, 3487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:50:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-17 02:50:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1405. [2024-11-17 02:50:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1172 states have (on average 1.492320819112628) internal successors, (1749), 1395 states have internal predecessors, (1749), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1761 transitions. [2024-11-17 02:50:13,797 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1761 transitions. Word has length 99 [2024-11-17 02:50:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:13,797 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1761 transitions. [2024-11-17 02:50:13,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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:50:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1761 transitions. [2024-11-17 02:50:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 02:50:13,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:13,799 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] [2024-11-17 02:50:13,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 02:50:13,799 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:13,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash -353897904, now seen corresponding path program 1 times [2024-11-17 02:50:13,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:13,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425523741] [2024-11-17 02:50:13,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:13,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:14,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:14,344 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:50:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425523741] [2024-11-17 02:50:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425523741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:14,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967866700] [2024-11-17 02:50:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:14,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:14,347 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:50:14,349 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:50:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:14,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 02:50:14,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:14,597 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:50:14,712 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:50:14,712 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:50:14,745 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:50:14,828 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:50:14,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:14,963 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:50:15,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:15,052 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:50:15,067 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:50:15,094 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:50:15,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:15,142 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1083) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:50:15,169 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (Array Int Int)) (v_ArrVal_1083 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1086))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:50:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967866700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:15,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-17 02:50:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488299026] [2024-11-17 02:50:15,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:15,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 02:50:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 02:50:15,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=432, Unknown=6, NotChecked=86, Total=600 [2024-11-17 02:50:15,176 INFO L87 Difference]: Start difference. First operand 1405 states and 1761 transitions. Second operand has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 states have internal predecessors, (158), 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:50:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:17,526 INFO L93 Difference]: Finished difference Result 1407 states and 1765 transitions. [2024-11-17 02:50:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:50:17,527 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 states have internal predecessors, (158), 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 100 [2024-11-17 02:50:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:17,529 INFO L225 Difference]: With dead ends: 1407 [2024-11-17 02:50:17,529 INFO L226 Difference]: Without dead ends: 1407 [2024-11-17 02:50:17,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=601, Unknown=6, NotChecked=102, Total=812 [2024-11-17 02:50:17,530 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 705 mSDsluCounter, 7505 mSDsCounter, 0 mSdLazyCounter, 5471 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 7988 SdHoareTripleChecker+Invalid, 5483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:17,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 7988 Invalid, 5483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5471 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:50:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-11-17 02:50:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1404. [2024-11-17 02:50:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1172 states have (on average 1.4906143344709897) internal successors, (1747), 1394 states have internal predecessors, (1747), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1759 transitions. [2024-11-17 02:50:17,547 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1759 transitions. Word has length 100 [2024-11-17 02:50:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:17,547 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1759 transitions. [2024-11-17 02:50:17,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 states have internal predecessors, (158), 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:50:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1759 transitions. [2024-11-17 02:50:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 02:50:17,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:17,548 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] [2024-11-17 02:50:17,566 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:50:17,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:17,753 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:17,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -353897903, now seen corresponding path program 1 times [2024-11-17 02:50:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:17,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359231371] [2024-11-17 02:50:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:18,568 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:50:18,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:18,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359231371] [2024-11-17 02:50:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359231371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:18,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115287140] [2024-11-17 02:50:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:18,571 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:50:18,572 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:50:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:18,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 02:50:18,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:18,811 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:50:18,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:18,909 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:50:18,914 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:50:18,934 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:50:18,938 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:50:19,010 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:50:19,014 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:50:19,106 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:19,107 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:50:19,111 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:50:19,185 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:19,186 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:50:19,195 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:50:19,215 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:50:19,220 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:50:19,235 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:50:19,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:19,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:50:19,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1244) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:50:19,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1249) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1250))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1249) .cse1 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1244) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 02:50:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115287140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:19,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:19,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-17 02:50:19,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363850478] [2024-11-17 02:50:19,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:19,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 02:50:19,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:19,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 02:50:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-17 02:50:19,363 INFO L87 Difference]: Start difference. First operand 1404 states and 1759 transitions. Second operand has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 20 states have internal predecessors, (158), 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:50:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:21,394 INFO L93 Difference]: Finished difference Result 1406 states and 1763 transitions. [2024-11-17 02:50:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:50:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 20 states have internal predecessors, (158), 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 100 [2024-11-17 02:50:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:21,396 INFO L225 Difference]: With dead ends: 1406 [2024-11-17 02:50:21,397 INFO L226 Difference]: Without dead ends: 1406 [2024-11-17 02:50:21,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 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:50:21,397 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 711 mSDsluCounter, 3996 mSDsCounter, 0 mSdLazyCounter, 4347 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 4366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:21,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 4482 Invalid, 4366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4347 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:50:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-17 02:50:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1388. [2024-11-17 02:50:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1158 states have (on average 1.4939550949913645) internal successors, (1730), 1380 states have internal predecessors, (1730), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:50:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1740 transitions. [2024-11-17 02:50:21,414 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1740 transitions. Word has length 100 [2024-11-17 02:50:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:21,414 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1740 transitions. [2024-11-17 02:50:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 20 states have internal predecessors, (158), 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:50:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1740 transitions. [2024-11-17 02:50:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:50:21,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:21,416 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:50:21,432 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:50:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 02:50:21,617 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash 201881212, now seen corresponding path program 1 times [2024-11-17 02:50:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552815574] [2024-11-17 02:50:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:22,122 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:50:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552815574] [2024-11-17 02:50:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552815574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:50:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640650721] [2024-11-17 02:50:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:22,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:50:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:22,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:50:22,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:50:22,124 INFO L87 Difference]: Start difference. First operand 1388 states and 1740 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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:50:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:23,302 INFO L93 Difference]: Finished difference Result 1413 states and 1771 transitions. [2024-11-17 02:50:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:50:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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 102 [2024-11-17 02:50:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:23,304 INFO L225 Difference]: With dead ends: 1413 [2024-11-17 02:50:23,305 INFO L226 Difference]: Without dead ends: 1413 [2024-11-17 02:50:23,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-17 02:50:23,305 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 745 mSDsluCounter, 3751 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:23,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 4237 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:50:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-11-17 02:50:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1409. [2024-11-17 02:50:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1178 states have (on average 1.4881154499151104) internal successors, (1753), 1399 states have internal predecessors, (1753), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1765 transitions. [2024-11-17 02:50:23,324 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1765 transitions. Word has length 102 [2024-11-17 02:50:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:23,324 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1765 transitions. [2024-11-17 02:50:23,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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:50:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1765 transitions. [2024-11-17 02:50:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:50:23,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:23,325 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:50:23,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-17 02:50:23,326 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:23,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash 201881213, now seen corresponding path program 1 times [2024-11-17 02:50:23,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:23,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864745947] [2024-11-17 02:50:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:24,036 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:50:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864745947] [2024-11-17 02:50:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864745947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:24,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:24,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:50:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372708986] [2024-11-17 02:50:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:50:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:24,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:50:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:50:24,038 INFO L87 Difference]: Start difference. First operand 1409 states and 1765 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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:50:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:25,399 INFO L93 Difference]: Finished difference Result 1412 states and 1769 transitions. [2024-11-17 02:50:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:50:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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 102 [2024-11-17 02:50:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:25,402 INFO L225 Difference]: With dead ends: 1412 [2024-11-17 02:50:25,402 INFO L226 Difference]: Without dead ends: 1412 [2024-11-17 02:50:25,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:50:25,403 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 742 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:25,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 3400 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:50:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-11-17 02:50:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1409. [2024-11-17 02:50:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1178 states have (on average 1.4864176570458405) internal successors, (1751), 1399 states have internal predecessors, (1751), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1763 transitions. [2024-11-17 02:50:25,416 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1763 transitions. Word has length 102 [2024-11-17 02:50:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:25,416 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1763 transitions. [2024-11-17 02:50:25,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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:50:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1763 transitions. [2024-11-17 02:50:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 02:50:25,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:25,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:25,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 02:50:25,417 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:25,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1173130336, now seen corresponding path program 1 times [2024-11-17 02:50:25,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:25,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722757663] [2024-11-17 02:50:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:26,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:26,051 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:50:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:26,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722757663] [2024-11-17 02:50:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722757663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:26,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929712781] [2024-11-17 02:50:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:26,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:26,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:26,053 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:50:26,054 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:50:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:26,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 02:50:26,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:26,277 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:50:26,368 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:50:26,369 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:50:26,398 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:50:26,477 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:50:26,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:26,597 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:50:26,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:26,667 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:50:26,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:26,714 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:50:26,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 31 treesize of output 13 [2024-11-17 02:50:26,759 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:50:26,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:26,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:50:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929712781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:26,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-17 02:50:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100680162] [2024-11-17 02:50:26,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:26,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 02:50:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:26,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 02:50:26,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=615, Unknown=43, NotChecked=52, Total=812 [2024-11-17 02:50:26,948 INFO L87 Difference]: Start difference. First operand 1409 states and 1763 transitions. Second operand has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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:50:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:28,896 INFO L93 Difference]: Finished difference Result 1411 states and 1767 transitions. [2024-11-17 02:50:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:50:28,897 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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 103 [2024-11-17 02:50:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:28,899 INFO L225 Difference]: With dead ends: 1411 [2024-11-17 02:50:28,899 INFO L226 Difference]: Without dead ends: 1411 [2024-11-17 02:50:28,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=820, Unknown=46, NotChecked=60, Total=1056 [2024-11-17 02:50:28,900 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 702 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 6128 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:28,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 6128 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4273 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:50:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-17 02:50:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1408. [2024-11-17 02:50:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1178 states have (on average 1.4847198641765704) internal successors, (1749), 1398 states have internal predecessors, (1749), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1761 transitions. [2024-11-17 02:50:28,912 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1761 transitions. Word has length 103 [2024-11-17 02:50:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1761 transitions. [2024-11-17 02:50:28,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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:50:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1761 transitions. [2024-11-17 02:50:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 02:50:28,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:28,913 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] [2024-11-17 02:50:28,928 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:50:29,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:29,114 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1173130337, now seen corresponding path program 1 times [2024-11-17 02:50:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:29,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714247522] [2024-11-17 02:50:29,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:29,956 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:50:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714247522] [2024-11-17 02:50:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714247522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041742340] [2024-11-17 02:50:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:29,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:29,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:29,959 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:50:29,961 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:50:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:30,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-17 02:50:30,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:30,199 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:50:30,273 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:50:30,278 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:30,279 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:50:30,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:50:30,304 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:50:30,372 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:50:30,374 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:50:30,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:30,447 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:50:30,452 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:50:30,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:30,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-17 02:50:30,532 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:50:30,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:30,588 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:50:30,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-17 02:50:30,632 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:50:30,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-17 02:50:30,661 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:50:30,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:31,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1743))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1742) .cse5 v_ArrVal_1734))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1735))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse0 .cse2 v_ArrVal_1737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1743))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1742) .cse8 v_ArrVal_1734))) (or (< (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-17 02:50:31,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041742340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:31,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-17 02:50:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449982139] [2024-11-17 02:50:31,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 02:50:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 02:50:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=745, Unknown=15, NotChecked=56, Total=930 [2024-11-17 02:50:31,161 INFO L87 Difference]: Start difference. First operand 1408 states and 1761 transitions. Second operand has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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:50:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:32,711 INFO L93 Difference]: Finished difference Result 1410 states and 1765 transitions. [2024-11-17 02:50:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:50:32,712 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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 103 [2024-11-17 02:50:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:32,714 INFO L225 Difference]: With dead ends: 1410 [2024-11-17 02:50:32,714 INFO L226 Difference]: Without dead ends: 1410 [2024-11-17 02:50:32,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=1129, Unknown=16, NotChecked=70, Total=1406 [2024-11-17 02:50:32,715 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 713 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 3171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:32,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 3299 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3171 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:50:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-11-17 02:50:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1386. [2024-11-17 02:50:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1158 states have (on average 1.4905008635578583) internal successors, (1726), 1378 states have internal predecessors, (1726), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:50:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1736 transitions. [2024-11-17 02:50:32,730 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1736 transitions. Word has length 103 [2024-11-17 02:50:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:32,730 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1736 transitions. [2024-11-17 02:50:32,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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:50:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1736 transitions. [2024-11-17 02:50:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 02:50:32,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:32,731 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:50:32,750 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:50:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:32,932 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1289842061, now seen corresponding path program 1 times [2024-11-17 02:50:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985381222] [2024-11-17 02:50:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:33,432 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:50:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985381222] [2024-11-17 02:50:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985381222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:33,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:33,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:50:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868597186] [2024-11-17 02:50:33,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:33,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:50:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:50:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:50:33,435 INFO L87 Difference]: Start difference. First operand 1386 states and 1736 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:34,624 INFO L93 Difference]: Finished difference Result 1417 states and 1773 transitions. [2024-11-17 02:50:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:50:34,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-17 02:50:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:34,626 INFO L225 Difference]: With dead ends: 1417 [2024-11-17 02:50:34,626 INFO L226 Difference]: Without dead ends: 1417 [2024-11-17 02:50:34,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-17 02:50:34,627 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 750 mSDsluCounter, 3790 mSDsCounter, 0 mSdLazyCounter, 2972 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:34,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 4275 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2972 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:50:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-17 02:50:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1413. [2024-11-17 02:50:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1184 states have (on average 1.4822635135135136) internal successors, (1755), 1403 states have internal predecessors, (1755), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1767 transitions. [2024-11-17 02:50:34,641 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1767 transitions. Word has length 105 [2024-11-17 02:50:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:34,642 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 1767 transitions. [2024-11-17 02:50:34,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1767 transitions. [2024-11-17 02:50:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 02:50:34,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:34,644 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:50:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-17 02:50:34,644 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:34,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1289842062, now seen corresponding path program 1 times [2024-11-17 02:50:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391698133] [2024-11-17 02:50:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:35,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:35,421 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:50:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:35,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391698133] [2024-11-17 02:50:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391698133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:35,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:35,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:50:35,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360569697] [2024-11-17 02:50:35,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:35,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:50:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:50:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:50:35,426 INFO L87 Difference]: Start difference. First operand 1413 states and 1767 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:36,989 INFO L93 Difference]: Finished difference Result 1416 states and 1771 transitions. [2024-11-17 02:50:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:50:36,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-17 02:50:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:36,992 INFO L225 Difference]: With dead ends: 1416 [2024-11-17 02:50:36,992 INFO L226 Difference]: Without dead ends: 1416 [2024-11-17 02:50:36,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-17 02:50:36,993 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 743 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 3164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:36,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 3292 Invalid, 3164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:50:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-11-17 02:50:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1413. [2024-11-17 02:50:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1184 states have (on average 1.4805743243243243) internal successors, (1753), 1403 states have internal predecessors, (1753), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1765 transitions. [2024-11-17 02:50:37,007 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1765 transitions. Word has length 105 [2024-11-17 02:50:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:37,008 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 1765 transitions. [2024-11-17 02:50:37,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:50:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1765 transitions. [2024-11-17 02:50:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 02:50:37,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:37,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:37,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-17 02:50:37,009 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:37,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 577821993, now seen corresponding path program 1 times [2024-11-17 02:50:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:37,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249334961] [2024-11-17 02:50:37,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:37,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:37,638 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:50:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:37,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249334961] [2024-11-17 02:50:37,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249334961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:37,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087226081] [2024-11-17 02:50:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:37,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:37,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:37,641 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:50:37,643 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:50:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:37,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 02:50:37,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:37,923 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:50:38,038 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:50:38,039 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:50:38,060 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:50:38,122 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:50:38,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:38,258 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:50:38,355 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:38,356 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:50:38,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:38,420 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:50:38,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:38,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:50:38,482 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:50:38,513 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:50:38,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:38,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2080) |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:50:38,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:50:38,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2078))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2079)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:50:38,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (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$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2083))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2078)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2079)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:50:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087226081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:38,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-17 02:50:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508334812] [2024-11-17 02:50:38,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:50:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:50:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=675, Unknown=27, NotChecked=228, Total=1056 [2024-11-17 02:50:38,698 INFO L87 Difference]: Start difference. First operand 1413 states and 1765 transitions. Second operand has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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:50:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:41,001 INFO L93 Difference]: Finished difference Result 1415 states and 1769 transitions. [2024-11-17 02:50:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:50:41,002 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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 106 [2024-11-17 02:50:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:41,004 INFO L225 Difference]: With dead ends: 1415 [2024-11-17 02:50:41,004 INFO L226 Difference]: Without dead ends: 1415 [2024-11-17 02:50:41,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=889, Unknown=28, NotChecked=260, Total=1332 [2024-11-17 02:50:41,005 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 699 mSDsluCounter, 6086 mSDsCounter, 0 mSdLazyCounter, 4661 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 6567 SdHoareTripleChecker+Invalid, 4674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:41,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 6567 Invalid, 4674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4661 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:50:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-17 02:50:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1412. [2024-11-17 02:50:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1184 states have (on average 1.478885135135135) internal successors, (1751), 1402 states have internal predecessors, (1751), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1763 transitions. [2024-11-17 02:50:41,023 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1763 transitions. Word has length 106 [2024-11-17 02:50:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 1763 transitions. [2024-11-17 02:50:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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:50:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1763 transitions. [2024-11-17 02:50:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 02:50:41,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:41,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:41,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 02:50:41,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:41,225 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:41,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash 577821994, now seen corresponding path program 1 times [2024-11-17 02:50:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748497076] [2024-11-17 02:50:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:42,198 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:50:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748497076] [2024-11-17 02:50:42,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748497076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240638932] [2024-11-17 02:50:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:42,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:50:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:50:42,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:50:42,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 02:50:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:42,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-17 02:50:42,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:50:42,479 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:50:42,566 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:50:42,574 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:50:42,574 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:50:42,598 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:50:42,602 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:50:42,659 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:50:42,662 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:50:42,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:42,736 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:50:42,743 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:50:42,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:42,811 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:50:42,816 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:50:42,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:42,860 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:50:42,865 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:50:42,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:50:42,920 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:50:42,923 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:50:42,935 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:50:42,939 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:50:42,955 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:50:42,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:50:43,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2266))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2267) .cse0 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2267) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-17 02:50:43,120 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2267) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2266))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2267) .cse2 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-17 02:50:43,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2265))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2266))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2264) .cse0 v_ArrVal_2267) .cse1 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2265))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2264) .cse5 v_ArrVal_2267) (select (select (store .cse6 .cse5 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2268))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-17 02:50:43,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2265))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2266))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2264) .cse1 v_ArrVal_2267) .cse2 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2265))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2264) .cse6 v_ArrVal_2267) (select (select (store .cse7 .cse6 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2268))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-11-17 02:50:43,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2274 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2274))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2265))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2275) .cse0 v_ArrVal_2264) .cse1 v_ArrVal_2267) (select (select (store .cse2 .cse1 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2268))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2274 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2274))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2265))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2266))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2275) .cse5 v_ArrVal_2264) .cse6 v_ArrVal_2267) .cse7 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-17 02:50:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240638932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:50:43,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:50:43,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-17 02:50:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50379101] [2024-11-17 02:50:43,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:50:43,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 02:50:43,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:43,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 02:50:43,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=687, Unknown=29, NotChecked=290, Total=1122 [2024-11-17 02:50:43,256 INFO L87 Difference]: Start difference. First operand 1412 states and 1763 transitions. Second operand has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 24 states have internal predecessors, (170), 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:50:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:45,625 INFO L93 Difference]: Finished difference Result 1414 states and 1767 transitions. [2024-11-17 02:50:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:50:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 24 states have internal predecessors, (170), 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 106 [2024-11-17 02:50:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:45,628 INFO L225 Difference]: With dead ends: 1414 [2024-11-17 02:50:45,628 INFO L226 Difference]: Without dead ends: 1414 [2024-11-17 02:50:45,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=1129, Unknown=30, NotChecked=370, Total=1722 [2024-11-17 02:50:45,629 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 708 mSDsluCounter, 4889 mSDsCounter, 0 mSdLazyCounter, 5087 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 5373 SdHoareTripleChecker+Invalid, 5104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:45,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 5373 Invalid, 5104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 5087 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:50:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-17 02:50:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1384. [2024-11-17 02:50:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1158 states have (on average 1.4870466321243523) internal successors, (1722), 1376 states have internal predecessors, (1722), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:50:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1732 transitions. [2024-11-17 02:50:45,646 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1732 transitions. Word has length 106 [2024-11-17 02:50:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:45,647 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1732 transitions. [2024-11-17 02:50:45,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 24 states have internal predecessors, (170), 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:50:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1732 transitions. [2024-11-17 02:50:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 02:50:45,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:45,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:45,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 02:50:45,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-17 02:50:45,849 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:45,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash -37878649, now seen corresponding path program 1 times [2024-11-17 02:50:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703283064] [2024-11-17 02:50:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:46,456 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:50:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703283064] [2024-11-17 02:50:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703283064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:50:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095462941] [2024-11-17 02:50:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:46,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:50:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:50:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:50:46,459 INFO L87 Difference]: Start difference. First operand 1384 states and 1732 transitions. Second operand has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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:50:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:50:48,113 INFO L93 Difference]: Finished difference Result 1423 states and 1777 transitions. [2024-11-17 02:50:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:50:48,113 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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 109 [2024-11-17 02:50:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:50:48,116 INFO L225 Difference]: With dead ends: 1423 [2024-11-17 02:50:48,116 INFO L226 Difference]: Without dead ends: 1423 [2024-11-17 02:50:48,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-11-17 02:50:48,117 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 754 mSDsluCounter, 4721 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:50:48,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 5205 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:50:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-11-17 02:50:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1419. [2024-11-17 02:50:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1192 states have (on average 1.4756711409395973) internal successors, (1759), 1409 states have internal predecessors, (1759), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:50:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1771 transitions. [2024-11-17 02:50:48,134 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1771 transitions. Word has length 109 [2024-11-17 02:50:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:50:48,134 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1771 transitions. [2024-11-17 02:50:48,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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:50:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1771 transitions. [2024-11-17 02:50:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 02:50:48,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:50:48,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:50:48,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-17 02:50:48,136 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:50:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:50:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash -37878648, now seen corresponding path program 1 times [2024-11-17 02:50:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:50:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289385715] [2024-11-17 02:50:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:50:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:50:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:50:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:50:49,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:50:49,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:50:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289385715] [2024-11-17 02:50:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289385715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:50:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:50:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 02:50:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682322424] [2024-11-17 02:50:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:50:49,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 02:50:49,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:50:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 02:50:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:50:49,167 INFO L87 Difference]: Start difference. First operand 1419 states and 1771 transitions. Second operand has 18 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 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)