./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:49:07,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:49:07,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 07:49:07,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:49:07,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:49:07,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:49:07,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:49:07,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:49:07,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:49:07,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:49:07,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:49:07,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:49:07,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:49:07,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:49:07,693 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:49:07,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:49:07,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:49:07,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:49:07,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:49:07,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:49:07,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:49:07,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:49:07,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:49:07,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:49:07,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:49:07,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:49:07,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:49:07,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:49:07,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:49:07,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:49:07,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:49:07,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:49:07,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:49:07,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:49:07,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:49:07,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2025-02-08 07:49:07,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:49:07,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:49:07,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:49:07,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:49:07,996 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:49:07,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2025-02-08 07:49:09,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01dd6177e/b9ffb4106acb4360862b18e2e583b3dc/FLAG18977f49b [2025-02-08 07:49:09,684 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:49:09,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2025-02-08 07:49:09,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01dd6177e/b9ffb4106acb4360862b18e2e583b3dc/FLAG18977f49b [2025-02-08 07:49:09,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01dd6177e/b9ffb4106acb4360862b18e2e583b3dc [2025-02-08 07:49:09,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:49:09,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:49:09,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:49:09,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:49:09,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:49:09,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:49:09" (1/1) ... [2025-02-08 07:49:09,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5066bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:09, skipping insertion in model container [2025-02-08 07:49:09,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:49:09" (1/1) ... [2025-02-08 07:49:09,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:49:10,417 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,444 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,447 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,452 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,457 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,479 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,480 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,481 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,481 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:49:10,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:49:10,501 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:49:10,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:49:10,681 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:49:10,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10 WrapperNode [2025-02-08 07:49:10,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:49:10,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:49:10,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:49:10,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:49:10,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:10,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:10,850 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-02-08 07:49:10,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:49:10,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:49:10,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:49:10,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:49:10,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:10,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:10,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:10,962 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [34, 2, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2025-02-08 07:49:10,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:10,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:11,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:11,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:11,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:11,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:11,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:49:11,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:49:11,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:49:11,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:49:11,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (1/1) ... [2025-02-08 07:49:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:49:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:49:11,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:49:11,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:49:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 07:49:11,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 07:49:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:49:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:49:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 07:49:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 07:49:11,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 07:49:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:49:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 07:49:11,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 07:49:11,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 07:49:11,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:49:11,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:49:11,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:49:11,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:49:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:49:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 07:49:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:49:11,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:49:11,384 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:49:11,385 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:49:14,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 07:49:14,840 INFO L? ?]: Removed 1536 outVars from TransFormulas that were not future-live. [2025-02-08 07:49:14,842 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:49:14,940 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:49:14,940 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 07:49:14,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:49:14 BoogieIcfgContainer [2025-02-08 07:49:14,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:49:14,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:49:14,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:49:14,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:49:14,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:49:09" (1/3) ... [2025-02-08 07:49:14,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63107bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:49:14, skipping insertion in model container [2025-02-08 07:49:14,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:49:10" (2/3) ... [2025-02-08 07:49:14,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63107bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:49:14, skipping insertion in model container [2025-02-08 07:49:14,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:49:14" (3/3) ... [2025-02-08 07:49:14,955 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2025-02-08 07:49:14,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:49:14,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test9-1.i that has 6 procedures, 2083 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-02-08 07:49:15,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:49:15,053 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;@194bac94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:49:15,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-02-08 07:49:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1142 states have (on average 1.998248686514886) internal successors, (2282), 2065 states have internal predecessors, (2282), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-08 07:49:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:49:15,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:15,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:49:15,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:15,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash 139679, now seen corresponding path program 1 times [2025-02-08 07:49:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098939324] [2025-02-08 07:49:15,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:15,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:49:15,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:49:15,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:15,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:15,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098939324] [2025-02-08 07:49:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098939324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:15,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:49:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238156570] [2025-02-08 07:49:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:15,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:49:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:15,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:49:15,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:15,314 INFO L87 Difference]: Start difference. First operand has 2073 states, 1142 states have (on average 1.998248686514886) internal successors, (2282), 2065 states have internal predecessors, (2282), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-02-08 07:49:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:16,678 INFO L93 Difference]: Finished difference Result 2059 states and 3222 transitions. [2025-02-08 07:49:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:49:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:49:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:16,710 INFO L225 Difference]: With dead ends: 2059 [2025-02-08 07:49:16,710 INFO L226 Difference]: Without dead ends: 2054 [2025-02-08 07:49:16,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:16,718 INFO L435 NwaCegarLoop]: 2792 mSDtfsCounter, 2098 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:16,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 2844 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:49:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2025-02-08 07:49:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2025-02-08 07:49:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1143 states have (on average 1.9335083114610674) internal successors, (2210), 2047 states have internal predecessors, (2210), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2718 transitions. [2025-02-08 07:49:16,841 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2718 transitions. Word has length 2 [2025-02-08 07:49:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:16,842 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2718 transitions. [2025-02-08 07:49:16,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-02-08 07:49:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2718 transitions. [2025-02-08 07:49:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:49:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:16,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:49:16,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:49:16,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:16,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 139680, now seen corresponding path program 1 times [2025-02-08 07:49:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595639312] [2025-02-08 07:49:16,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:16,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:49:16,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:49:16,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:16,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:16,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595639312] [2025-02-08 07:49:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595639312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:16,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:16,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:49:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597694527] [2025-02-08 07:49:16,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:16,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:49:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:16,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:49:16,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:16,973 INFO L87 Difference]: Start difference. First operand 2054 states and 2718 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-02-08 07:49:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:18,152 INFO L93 Difference]: Finished difference Result 2140 states and 2809 transitions. [2025-02-08 07:49:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:49:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:49:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:18,162 INFO L225 Difference]: With dead ends: 2140 [2025-02-08 07:49:18,162 INFO L226 Difference]: Without dead ends: 2140 [2025-02-08 07:49:18,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:18,163 INFO L435 NwaCegarLoop]: 2425 mSDtfsCounter, 1838 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:18,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 2654 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:49:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-02-08 07:49:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2092. [2025-02-08 07:49:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1191 states have (on average 1.9252728799328296) internal successors, (2293), 2085 states have internal predecessors, (2293), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2801 transitions. [2025-02-08 07:49:18,232 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2801 transitions. Word has length 2 [2025-02-08 07:49:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:18,233 INFO L471 AbstractCegarLoop]: Abstraction has 2092 states and 2801 transitions. [2025-02-08 07:49:18,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-02-08 07:49:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2801 transitions. [2025-02-08 07:49:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 07:49:18,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:18,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:49:18,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:49:18,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:18,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash 85080681, now seen corresponding path program 1 times [2025-02-08 07:49:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184246531] [2025-02-08 07:49:18,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:18,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 07:49:18,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 07:49:18,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:18,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184246531] [2025-02-08 07:49:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184246531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:49:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644001837] [2025-02-08 07:49:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:18,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:49:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:18,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:49:18,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:49:18,489 INFO L87 Difference]: Start difference. First operand 2092 states and 2801 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2025-02-08 07:49:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:21,001 INFO L93 Difference]: Finished difference Result 3403 states and 4689 transitions. [2025-02-08 07:49:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:49:21,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2025-02-08 07:49:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:21,015 INFO L225 Difference]: With dead ends: 3403 [2025-02-08 07:49:21,016 INFO L226 Difference]: Without dead ends: 3403 [2025-02-08 07:49:21,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:49:21,019 INFO L435 NwaCegarLoop]: 3791 mSDtfsCounter, 6355 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6355 SdHoareTripleChecker+Valid, 6068 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:21,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6355 Valid, 6068 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 07:49:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-02-08 07:49:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 2042. [2025-02-08 07:49:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1143 states have (on average 1.9221347331583551) internal successors, (2197), 2035 states have internal predecessors, (2197), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2705 transitions. [2025-02-08 07:49:21,072 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2705 transitions. Word has length 7 [2025-02-08 07:49:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:21,072 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 2705 transitions. [2025-02-08 07:49:21,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2025-02-08 07:49:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2705 transitions. [2025-02-08 07:49:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:49:21,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:21,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:49:21,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:49:21,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1657461931, now seen corresponding path program 1 times [2025-02-08 07:49:21,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:21,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181204559] [2025-02-08 07:49:21,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:21,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:21,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:49:21,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:49:21,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:21,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:21,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181204559] [2025-02-08 07:49:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181204559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:21,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:49:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113367962] [2025-02-08 07:49:21,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:21,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:49:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:21,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:49:21,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:21,163 INFO L87 Difference]: Start difference. First operand 2042 states and 2705 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:22,258 INFO L93 Difference]: Finished difference Result 3308 states and 4549 transitions. [2025-02-08 07:49:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:49:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:49:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:22,272 INFO L225 Difference]: With dead ends: 3308 [2025-02-08 07:49:22,272 INFO L226 Difference]: Without dead ends: 3308 [2025-02-08 07:49:22,273 INFO L434 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 [2025-02-08 07:49:22,275 INFO L435 NwaCegarLoop]: 4074 mSDtfsCounter, 2072 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 5861 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:22,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 5861 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:49:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2025-02-08 07:49:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 1995. [2025-02-08 07:49:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1143 states have (on average 1.8810148731408574) internal successors, (2150), 1988 states have internal predecessors, (2150), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2658 transitions. [2025-02-08 07:49:22,342 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2658 transitions. Word has length 8 [2025-02-08 07:49:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:22,342 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 2658 transitions. [2025-02-08 07:49:22,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2658 transitions. [2025-02-08 07:49:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:49:22,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:22,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:49:22,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:49:22,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:22,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1657461930, now seen corresponding path program 1 times [2025-02-08 07:49:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105324895] [2025-02-08 07:49:22,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:22,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:49:22,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:49:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:22,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:22,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:22,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105324895] [2025-02-08 07:49:22,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105324895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:22,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:22,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:49:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20875142] [2025-02-08 07:49:22,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:22,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:49:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:22,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:49:22,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:22,457 INFO L87 Difference]: Start difference. First operand 1995 states and 2658 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:23,528 INFO L93 Difference]: Finished difference Result 3288 states and 4528 transitions. [2025-02-08 07:49:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:49:23,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:49:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:23,541 INFO L225 Difference]: With dead ends: 3288 [2025-02-08 07:49:23,541 INFO L226 Difference]: Without dead ends: 3288 [2025-02-08 07:49:23,542 INFO L434 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 [2025-02-08 07:49:23,542 INFO L435 NwaCegarLoop]: 4208 mSDtfsCounter, 1863 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 6110 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:23,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 6110 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:49:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-02-08 07:49:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 1970. [2025-02-08 07:49:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1143 states have (on average 1.8591426071741033) internal successors, (2125), 1963 states have internal predecessors, (2125), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2633 transitions. [2025-02-08 07:49:23,613 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2633 transitions. Word has length 8 [2025-02-08 07:49:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:23,613 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2633 transitions. [2025-02-08 07:49:23,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2633 transitions. [2025-02-08 07:49:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 07:49:23,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:23,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:49:23,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 07:49:23,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:23,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1148446148, now seen corresponding path program 1 times [2025-02-08 07:49:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501974829] [2025-02-08 07:49:23,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:23,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:49:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:49:23,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:23,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501974829] [2025-02-08 07:49:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501974829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:23,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:49:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855290335] [2025-02-08 07:49:23,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:49:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:23,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:49:23,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:49:23,691 INFO L87 Difference]: Start difference. First operand 1970 states and 2633 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-02-08 07:49:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:24,335 INFO L93 Difference]: Finished difference Result 3921 states and 5249 transitions. [2025-02-08 07:49:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:49:24,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-02-08 07:49:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:24,348 INFO L225 Difference]: With dead ends: 3921 [2025-02-08 07:49:24,348 INFO L226 Difference]: Without dead ends: 3921 [2025-02-08 07:49:24,349 INFO L434 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 [2025-02-08 07:49:24,349 INFO L435 NwaCegarLoop]: 2546 mSDtfsCounter, 2096 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 7130 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:24,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 7130 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:49:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2025-02-08 07:49:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 1973. [2025-02-08 07:49:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1146 states have (on average 1.8568935427574171) internal successors, (2128), 1966 states have internal predecessors, (2128), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 2636 transitions. [2025-02-08 07:49:24,395 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 2636 transitions. Word has length 11 [2025-02-08 07:49:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:24,395 INFO L471 AbstractCegarLoop]: Abstraction has 1973 states and 2636 transitions. [2025-02-08 07:49:24,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-02-08 07:49:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2636 transitions. [2025-02-08 07:49:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 07:49:24,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:24,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:49:24,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:49:24,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:24,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash 982767464, now seen corresponding path program 1 times [2025-02-08 07:49:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:24,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778737917] [2025-02-08 07:49:24,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:24,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 07:49:24,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 07:49:24,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:24,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:24,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778737917] [2025-02-08 07:49:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778737917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:24,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:24,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:49:24,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292806115] [2025-02-08 07:49:24,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:24,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:49:24,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:24,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:49:24,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:49:24,486 INFO L87 Difference]: Start difference. First operand 1973 states and 2636 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:25,634 INFO L93 Difference]: Finished difference Result 1999 states and 2689 transitions. [2025-02-08 07:49:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:49:25,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 07:49:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:25,641 INFO L225 Difference]: With dead ends: 1999 [2025-02-08 07:49:25,641 INFO L226 Difference]: Without dead ends: 1999 [2025-02-08 07:49:25,641 INFO L434 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 [2025-02-08 07:49:25,642 INFO L435 NwaCegarLoop]: 2181 mSDtfsCounter, 2336 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:25,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 3744 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:49:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2025-02-08 07:49:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1950. [2025-02-08 07:49:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1146 states have (on average 1.8368237347294938) internal successors, (2105), 1943 states have internal predecessors, (2105), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2613 transitions. [2025-02-08 07:49:25,676 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2613 transitions. Word has length 18 [2025-02-08 07:49:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:25,676 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2613 transitions. [2025-02-08 07:49:25,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2613 transitions. [2025-02-08 07:49:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 07:49:25,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:25,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:49:25,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:49:25,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:25,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash 982767465, now seen corresponding path program 1 times [2025-02-08 07:49:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:25,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145470194] [2025-02-08 07:49:25,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:25,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 07:49:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 07:49:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:25,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:25,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:25,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145470194] [2025-02-08 07:49:25,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145470194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:25,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:25,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:49:25,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142243770] [2025-02-08 07:49:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:25,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:49:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:25,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:49:25,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:25,747 INFO L87 Difference]: Start difference. First operand 1950 states and 2613 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:25,826 INFO L93 Difference]: Finished difference Result 1875 states and 2510 transitions. [2025-02-08 07:49:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:49:25,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 07:49:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:25,832 INFO L225 Difference]: With dead ends: 1875 [2025-02-08 07:49:25,832 INFO L226 Difference]: Without dead ends: 1875 [2025-02-08 07:49:25,832 INFO L434 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 [2025-02-08 07:49:25,833 INFO L435 NwaCegarLoop]: 2456 mSDtfsCounter, 60 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4859 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:25,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 4859 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:49:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-02-08 07:49:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2025-02-08 07:49:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1083 states have (on average 1.8485687903970451) internal successors, (2002), 1868 states have internal predecessors, (2002), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2510 transitions. [2025-02-08 07:49:25,871 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2510 transitions. Word has length 18 [2025-02-08 07:49:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:25,871 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2510 transitions. [2025-02-08 07:49:25,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2510 transitions. [2025-02-08 07:49:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 07:49:25,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:25,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:49:25,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:49:25,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:25,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 400899488, now seen corresponding path program 1 times [2025-02-08 07:49:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:25,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481685930] [2025-02-08 07:49:25,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:25,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 07:49:25,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 07:49:25,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:25,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:25,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481685930] [2025-02-08 07:49:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481685930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:25,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:25,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:49:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918309911] [2025-02-08 07:49:25,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:25,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:49:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:25,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:49:25,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:49:25,949 INFO L87 Difference]: Start difference. First operand 1875 states and 2510 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) [2025-02-08 07:49:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:26,087 INFO L93 Difference]: Finished difference Result 1857 states and 2485 transitions. [2025-02-08 07:49:26,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:49:26,088 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 [2025-02-08 07:49:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:26,094 INFO L225 Difference]: With dead ends: 1857 [2025-02-08 07:49:26,094 INFO L226 Difference]: Without dead ends: 1857 [2025-02-08 07:49:26,094 INFO L434 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 [2025-02-08 07:49:26,095 INFO L435 NwaCegarLoop]: 2421 mSDtfsCounter, 41 mSDsluCounter, 4814 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 7235 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:26,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 7235 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:49:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-02-08 07:49:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1854. [2025-02-08 07:49:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1069 states have (on average 1.8465855940130964) internal successors, (1974), 1847 states have internal predecessors, (1974), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2482 transitions. [2025-02-08 07:49:26,134 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2482 transitions. Word has length 19 [2025-02-08 07:49:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:26,134 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2482 transitions. [2025-02-08 07:49:26,135 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) [2025-02-08 07:49:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2482 transitions. [2025-02-08 07:49:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 07:49:26,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:26,135 INFO L218 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] [2025-02-08 07:49:26,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:49:26,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:26,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash -216991242, now seen corresponding path program 1 times [2025-02-08 07:49:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542520355] [2025-02-08 07:49:26,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:26,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 07:49:26,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 07:49:26,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:26,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542520355] [2025-02-08 07:49:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542520355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:26,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:49:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090828521] [2025-02-08 07:49:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:49:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:26,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:49:26,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:49:26,341 INFO L87 Difference]: Start difference. First operand 1854 states and 2482 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) [2025-02-08 07:49:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:27,625 INFO L93 Difference]: Finished difference Result 3217 states and 4449 transitions. [2025-02-08 07:49:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:49:27,626 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 [2025-02-08 07:49:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:27,635 INFO L225 Difference]: With dead ends: 3217 [2025-02-08 07:49:27,635 INFO L226 Difference]: Without dead ends: 3217 [2025-02-08 07:49:27,636 INFO L434 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 [2025-02-08 07:49:27,636 INFO L435 NwaCegarLoop]: 2231 mSDtfsCounter, 1864 mSDsluCounter, 2961 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 5192 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:27,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 5192 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:49:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-02-08 07:49:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 1850. [2025-02-08 07:49:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1069 states have (on average 1.842843779232928) internal successors, (1970), 1843 states have internal predecessors, (1970), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2478 transitions. [2025-02-08 07:49:27,668 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2478 transitions. Word has length 33 [2025-02-08 07:49:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:27,668 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2478 transitions. [2025-02-08 07:49:27,668 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) [2025-02-08 07:49:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2478 transitions. [2025-02-08 07:49:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 07:49:27,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:27,670 INFO L218 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] [2025-02-08 07:49:27,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:49:27,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash -912220857, now seen corresponding path program 1 times [2025-02-08 07:49:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298637577] [2025-02-08 07:49:27,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:27,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 07:49:27,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 07:49:27,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:27,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298637577] [2025-02-08 07:49:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298637577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:49:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759412918] [2025-02-08 07:49:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:27,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:49:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:27,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:49:27,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:49:27,814 INFO L87 Difference]: Start difference. First operand 1850 states and 2478 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:27,930 INFO L93 Difference]: Finished difference Result 1850 states and 2474 transitions. [2025-02-08 07:49:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:49:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-08 07:49:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:27,937 INFO L225 Difference]: With dead ends: 1850 [2025-02-08 07:49:27,937 INFO L226 Difference]: Without dead ends: 1850 [2025-02-08 07:49:27,937 INFO L434 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 [2025-02-08 07:49:27,938 INFO L435 NwaCegarLoop]: 2416 mSDtfsCounter, 21 mSDsluCounter, 4801 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7217 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:27,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7217 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:49:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-02-08 07:49:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2025-02-08 07:49:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1069 states have (on average 1.8391019644527595) internal successors, (1966), 1843 states have internal predecessors, (1966), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2474 transitions. [2025-02-08 07:49:27,972 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2474 transitions. Word has length 68 [2025-02-08 07:49:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:27,972 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2474 transitions. [2025-02-08 07:49:27,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2474 transitions. [2025-02-08 07:49:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:49:27,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:27,976 INFO L218 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] [2025-02-08 07:49:27,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:49:27,976 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:27,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash -553459969, now seen corresponding path program 1 times [2025-02-08 07:49:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:27,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004706714] [2025-02-08 07:49:27,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:28,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:49:28,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:49:28,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:28,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:28,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004706714] [2025-02-08 07:49:28,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004706714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:28,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:49:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768658343] [2025-02-08 07:49:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:49:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:28,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:49:28,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:49:28,146 INFO L87 Difference]: Start difference. First operand 1850 states and 2474 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:28,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:28,316 INFO L93 Difference]: Finished difference Result 3177 states and 4395 transitions. [2025-02-08 07:49:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:49:28,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-08 07:49:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:28,332 INFO L225 Difference]: With dead ends: 3177 [2025-02-08 07:49:28,332 INFO L226 Difference]: Without dead ends: 3177 [2025-02-08 07:49:28,333 INFO L434 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 [2025-02-08 07:49:28,333 INFO L435 NwaCegarLoop]: 2692 mSDtfsCounter, 1349 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 5077 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:28,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 5077 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:49:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2025-02-08 07:49:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2623. [2025-02-08 07:49:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1842 states have (on average 1.8371335504885993) internal successors, (3384), 2616 states have internal predecessors, (3384), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 3892 transitions. [2025-02-08 07:49:28,382 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 3892 transitions. Word has length 76 [2025-02-08 07:49:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:28,382 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 3892 transitions. [2025-02-08 07:49:28,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3892 transitions. [2025-02-08 07:49:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:49:28,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:28,385 INFO L218 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] [2025-02-08 07:49:28,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:49:28,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:28,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1694433930, now seen corresponding path program 1 times [2025-02-08 07:49:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866164232] [2025-02-08 07:49:28,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:28,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:49:28,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:49:28,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:28,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866164232] [2025-02-08 07:49:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866164232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:28,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:49:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983516696] [2025-02-08 07:49:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:28,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:49:28,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:28,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:49:28,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:49:28,726 INFO L87 Difference]: Start difference. First operand 2623 states and 3892 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:29,352 INFO L93 Difference]: Finished difference Result 2622 states and 3891 transitions. [2025-02-08 07:49:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:49:29,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 07:49:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:29,357 INFO L225 Difference]: With dead ends: 2622 [2025-02-08 07:49:29,357 INFO L226 Difference]: Without dead ends: 2622 [2025-02-08 07:49:29,358 INFO L434 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 [2025-02-08 07:49:29,358 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 2 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8716 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:29,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8716 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:49:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2025-02-08 07:49:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2622. [2025-02-08 07:49:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1842 states have (on average 1.8365906623235613) internal successors, (3383), 2615 states have internal predecessors, (3383), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3891 transitions. [2025-02-08 07:49:29,393 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3891 transitions. Word has length 84 [2025-02-08 07:49:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:29,393 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 3891 transitions. [2025-02-08 07:49:29,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3891 transitions. [2025-02-08 07:49:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:49:29,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:29,394 INFO L218 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] [2025-02-08 07:49:29,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:49:29,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:29,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1694433931, now seen corresponding path program 1 times [2025-02-08 07:49:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649016147] [2025-02-08 07:49:29,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:29,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:29,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:49:29,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:49:29,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:29,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:29,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649016147] [2025-02-08 07:49:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649016147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:29,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:49:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168036652] [2025-02-08 07:49:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:29,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:49:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:29,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:49:29,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:49:29,837 INFO L87 Difference]: Start difference. First operand 2622 states and 3891 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:30,505 INFO L93 Difference]: Finished difference Result 2621 states and 3890 transitions. [2025-02-08 07:49:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:49:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 07:49:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:30,509 INFO L225 Difference]: With dead ends: 2621 [2025-02-08 07:49:30,509 INFO L226 Difference]: Without dead ends: 2621 [2025-02-08 07:49:30,509 INFO L434 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 [2025-02-08 07:49:30,510 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 1 mSDsluCounter, 6261 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8687 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:30,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8687 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:49:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2025-02-08 07:49:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2621. [2025-02-08 07:49:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 1841 states have (on average 1.8370450841933732) internal successors, (3382), 2614 states have internal predecessors, (3382), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 3890 transitions. [2025-02-08 07:49:30,543 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 3890 transitions. Word has length 84 [2025-02-08 07:49:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:30,544 INFO L471 AbstractCegarLoop]: Abstraction has 2621 states and 3890 transitions. [2025-02-08 07:49:30,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:49:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 3890 transitions. [2025-02-08 07:49:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 07:49:30,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:30,545 INFO L218 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] [2025-02-08 07:49:30,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:49:30,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1277031833, now seen corresponding path program 1 times [2025-02-08 07:49:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243801831] [2025-02-08 07:49:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:30,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 07:49:30,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 07:49:30,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:30,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243801831] [2025-02-08 07:49:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243801831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:49:30,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388331393] [2025-02-08 07:49:30,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:30,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:49:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:30,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:49:30,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:49:30,802 INFO L87 Difference]: Start difference. First operand 2621 states and 3890 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:32,190 INFO L93 Difference]: Finished difference Result 2633 states and 3905 transitions. [2025-02-08 07:49:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:49:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-02-08 07:49:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:32,198 INFO L225 Difference]: With dead ends: 2633 [2025-02-08 07:49:32,198 INFO L226 Difference]: Without dead ends: 2633 [2025-02-08 07:49:32,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:49:32,199 INFO L435 NwaCegarLoop]: 2413 mSDtfsCounter, 11 mSDsluCounter, 8249 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10662 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10662 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 07:49:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-02-08 07:49:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2627. [2025-02-08 07:49:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1846 states have (on average 1.8358613217768147) internal successors, (3389), 2619 states have internal predecessors, (3389), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:49:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3900 transitions. [2025-02-08 07:49:32,266 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3900 transitions. Word has length 92 [2025-02-08 07:49:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:32,266 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 3900 transitions. [2025-02-08 07:49:32,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3900 transitions. [2025-02-08 07:49:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 07:49:32,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:32,267 INFO L218 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] [2025-02-08 07:49:32,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:49:32,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:32,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1277031832, now seen corresponding path program 1 times [2025-02-08 07:49:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599703179] [2025-02-08 07:49:32,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:32,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:32,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 07:49:32,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 07:49:32,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:32,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:32,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:32,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599703179] [2025-02-08 07:49:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599703179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:32,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:49:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893801366] [2025-02-08 07:49:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:32,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:49:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:32,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:49:32,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:49:32,832 INFO L87 Difference]: Start difference. First operand 2627 states and 3900 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:34,195 INFO L93 Difference]: Finished difference Result 2627 states and 3899 transitions. [2025-02-08 07:49:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:49:34,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-02-08 07:49:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:34,203 INFO L225 Difference]: With dead ends: 2627 [2025-02-08 07:49:34,203 INFO L226 Difference]: Without dead ends: 2627 [2025-02-08 07:49:34,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:49:34,205 INFO L435 NwaCegarLoop]: 2417 mSDtfsCounter, 6 mSDsluCounter, 8046 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10463 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:34,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10463 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 07:49:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2025-02-08 07:49:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2627. [2025-02-08 07:49:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 1846 states have (on average 1.8353196099674973) internal successors, (3388), 2619 states have internal predecessors, (3388), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:49:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3899 transitions. [2025-02-08 07:49:34,243 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3899 transitions. Word has length 92 [2025-02-08 07:49:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:34,244 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 3899 transitions. [2025-02-08 07:49:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3899 transitions. [2025-02-08 07:49:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:49:34,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:34,245 INFO L218 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] [2025-02-08 07:49:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:49:34,245 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1803443778, now seen corresponding path program 1 times [2025-02-08 07:49:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365379025] [2025-02-08 07:49:34,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:49:34,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:49:34,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:34,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:34,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:34,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365379025] [2025-02-08 07:49:34,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365379025] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:34,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018303261] [2025-02-08 07:49:34,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:34,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:49:34,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:49:34,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:49:34,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:49:34,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:49:34,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:49:34,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:34,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:34,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 07:49:34,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:49:35,004 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 [2025-02-08 07:49:35,164 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:49:35,165 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 [2025-02-08 07:49:35,214 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 [2025-02-08 07:49:35,336 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 [2025-02-08 07:49:35,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:49:35,530 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 [2025-02-08 07:49:35,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:49:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:35,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:49:35,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:49:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018303261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:35,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:49:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-02-08 07:49:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138949694] [2025-02-08 07:49:35,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:49:35,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:49:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:35,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:49:35,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-08 07:49:35,648 INFO L87 Difference]: Start difference. First operand 2627 states and 3899 transitions. Second operand has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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) [2025-02-08 07:49:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:40,084 INFO L93 Difference]: Finished difference Result 2634 states and 3906 transitions. [2025-02-08 07:49:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:49:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-02-08 07:49:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:40,089 INFO L225 Difference]: With dead ends: 2634 [2025-02-08 07:49:40,089 INFO L226 Difference]: Without dead ends: 2634 [2025-02-08 07:49:40,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-02-08 07:49:40,090 INFO L435 NwaCegarLoop]: 2081 mSDtfsCounter, 1864 mSDsluCounter, 19236 mSDsCounter, 0 mSdLazyCounter, 8191 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 21317 SdHoareTripleChecker+Invalid, 8708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 8191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:40,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 21317 Invalid, 8708 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 8191 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 07:49:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-08 07:49:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2631. [2025-02-08 07:49:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 1850 states have (on average 1.8335135135135134) internal successors, (3392), 2622 states have internal predecessors, (3392), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:49:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3901 transitions. [2025-02-08 07:49:40,123 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3901 transitions. Word has length 93 [2025-02-08 07:49:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:40,123 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3901 transitions. [2025-02-08 07:49:40,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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) [2025-02-08 07:49:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3901 transitions. [2025-02-08 07:49:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:49:40,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:40,124 INFO L218 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] [2025-02-08 07:49:40,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:49:40,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 07:49:40,325 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:40,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1803443779, now seen corresponding path program 1 times [2025-02-08 07:49:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:40,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761700721] [2025-02-08 07:49:40,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:40,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:49:40,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:49:40,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:40,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:41,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761700721] [2025-02-08 07:49:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761700721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90401894] [2025-02-08 07:49:41,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:41,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:49:41,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:49:41,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:49:41,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:49:41,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:49:41,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:49:41,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:41,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:41,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 07:49:41,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:49:41,311 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 [2025-02-08 07:49:41,428 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 [2025-02-08 07:49:41,437 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:49:41,438 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 [2025-02-08 07:49:41,457 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 [2025-02-08 07:49:41,462 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 [2025-02-08 07:49:41,529 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 [2025-02-08 07:49:41,534 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 [2025-02-08 07:49:41,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:49:41,632 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 [2025-02-08 07:49:41,639 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 [2025-02-08 07:49:41,663 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 [2025-02-08 07:49:41,667 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 [2025-02-08 07:49:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:41,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:49:41,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_739 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2025-02-08 07:49:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90401894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:41,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:49:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-02-08 07:49:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916307059] [2025-02-08 07:49:41,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:49:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:49:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:41,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:49:41,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-08 07:49:41,760 INFO L87 Difference]: Start difference. First operand 2631 states and 3901 transitions. Second operand has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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) [2025-02-08 07:49:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:45,135 INFO L93 Difference]: Finished difference Result 2633 states and 3905 transitions. [2025-02-08 07:49:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:49:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-02-08 07:49:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:45,141 INFO L225 Difference]: With dead ends: 2633 [2025-02-08 07:49:45,141 INFO L226 Difference]: Without dead ends: 2633 [2025-02-08 07:49:45,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-08 07:49:45,142 INFO L435 NwaCegarLoop]: 2084 mSDtfsCounter, 1866 mSDsluCounter, 16365 mSDsCounter, 0 mSdLazyCounter, 6096 mSolverCounterSat, 1021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 18449 SdHoareTripleChecker+Invalid, 7117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1021 IncrementalHoareTripleChecker+Valid, 6096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:45,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 18449 Invalid, 7117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1021 Valid, 6096 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 07:49:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-02-08 07:49:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2624. [2025-02-08 07:49:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 1845 states have (on average 1.834688346883469) internal successors, (3385), 2616 states have internal predecessors, (3385), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:49:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3893 transitions. [2025-02-08 07:49:45,181 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3893 transitions. Word has length 93 [2025-02-08 07:49:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:45,181 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3893 transitions. [2025-02-08 07:49:45,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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) [2025-02-08 07:49:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3893 transitions. [2025-02-08 07:49:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 07:49:45,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:45,182 INFO L218 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] [2025-02-08 07:49:45,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 07:49:45,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 07:49:45,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:45,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 768827778, now seen corresponding path program 1 times [2025-02-08 07:49:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779565775] [2025-02-08 07:49:45,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:45,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 07:49:45,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 07:49:45,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:45,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:45,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779565775] [2025-02-08 07:49:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779565775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:45,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 07:49:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182664068] [2025-02-08 07:49:45,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:45,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:49:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:45,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:49:45,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:49:45,887 INFO L87 Difference]: Start difference. First operand 2624 states and 3893 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:48,970 INFO L93 Difference]: Finished difference Result 2637 states and 3909 transitions. [2025-02-08 07:49:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:49:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-02-08 07:49:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:48,974 INFO L225 Difference]: With dead ends: 2637 [2025-02-08 07:49:48,974 INFO L226 Difference]: Without dead ends: 2637 [2025-02-08 07:49:48,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:49:48,975 INFO L435 NwaCegarLoop]: 2081 mSDtfsCounter, 1895 mSDsluCounter, 15592 mSDsCounter, 0 mSdLazyCounter, 6891 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1899 SdHoareTripleChecker+Valid, 17673 SdHoareTripleChecker+Invalid, 7404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 6891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:48,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1899 Valid, 17673 Invalid, 7404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 6891 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 07:49:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-02-08 07:49:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2633. [2025-02-08 07:49:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1853 states have (on average 1.832164058283864) internal successors, (3395), 2624 states have internal predecessors, (3395), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:49:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3904 transitions. [2025-02-08 07:49:49,004 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3904 transitions. Word has length 95 [2025-02-08 07:49:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:49,005 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3904 transitions. [2025-02-08 07:49:49,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3904 transitions. [2025-02-08 07:49:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 07:49:49,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:49,006 INFO L218 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] [2025-02-08 07:49:49,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 07:49:49,006 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:49,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 768827779, now seen corresponding path program 1 times [2025-02-08 07:49:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:49,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351994190] [2025-02-08 07:49:49,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:49,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 07:49:49,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 07:49:49,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:49,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351994190] [2025-02-08 07:49:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351994190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:49:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:49:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:49:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033688939] [2025-02-08 07:49:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:49:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:49:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:49,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:49:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:49:49,623 INFO L87 Difference]: Start difference. First operand 2633 states and 3904 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:52,327 INFO L93 Difference]: Finished difference Result 2636 states and 3908 transitions. [2025-02-08 07:49:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 07:49:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-02-08 07:49:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:52,333 INFO L225 Difference]: With dead ends: 2636 [2025-02-08 07:49:52,333 INFO L226 Difference]: Without dead ends: 2636 [2025-02-08 07:49:52,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:49:52,334 INFO L435 NwaCegarLoop]: 2085 mSDtfsCounter, 1877 mSDsluCounter, 12974 mSDsCounter, 0 mSdLazyCounter, 4607 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 15059 SdHoareTripleChecker+Invalid, 5119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 4607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:52,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 15059 Invalid, 5119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 4607 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 07:49:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-08 07:49:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2633. [2025-02-08 07:49:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1853 states have (on average 1.8316243928764167) internal successors, (3394), 2624 states have internal predecessors, (3394), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:49:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3903 transitions. [2025-02-08 07:49:52,375 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3903 transitions. Word has length 95 [2025-02-08 07:49:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:52,375 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3903 transitions. [2025-02-08 07:49:52,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:49:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3903 transitions. [2025-02-08 07:49:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 07:49:52,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:52,376 INFO L218 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] [2025-02-08 07:49:52,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:49:52,377 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:52,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash 651541447, now seen corresponding path program 1 times [2025-02-08 07:49:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:52,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885539907] [2025-02-08 07:49:52,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:52,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 07:49:52,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 07:49:52,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:52,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885539907] [2025-02-08 07:49:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885539907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:52,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362168085] [2025-02-08 07:49:52,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:52,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:49:52,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:49:52,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:49:52,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:49:53,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 07:49:53,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 07:49:53,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:53,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:53,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 07:49:53,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:49:53,130 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 [2025-02-08 07:49:53,245 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:49:53,245 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 [2025-02-08 07:49:53,274 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 [2025-02-08 07:49:53,346 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 [2025-02-08 07:49:53,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:49:53,473 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 [2025-02-08 07:49:53,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:49:53,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 42 treesize of output 41 [2025-02-08 07:49:53,568 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 [2025-02-08 07:49:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:53,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:49:53,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:49:53,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1024))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1021)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:49:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362168085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:53,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:49:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-08 07:49:53,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377198877] [2025-02-08 07:49:53,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:49:53,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:49:53,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:53,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:49:53,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=427, Unknown=7, NotChecked=86, Total=600 [2025-02-08 07:49:53,782 INFO L87 Difference]: Start difference. First operand 2633 states and 3903 transitions. Second operand has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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) [2025-02-08 07:49:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:49:57,139 INFO L93 Difference]: Finished difference Result 2635 states and 3907 transitions. [2025-02-08 07:49:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:49:57,140 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2025-02-08 07:49:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:49:57,144 INFO L225 Difference]: With dead ends: 2635 [2025-02-08 07:49:57,145 INFO L226 Difference]: Without dead ends: 2635 [2025-02-08 07:49:57,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=549, Unknown=7, NotChecked=98, Total=756 [2025-02-08 07:49:57,146 INFO L435 NwaCegarLoop]: 2080 mSDtfsCounter, 1857 mSDsluCounter, 15615 mSDsCounter, 0 mSdLazyCounter, 6915 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 17695 SdHoareTripleChecker+Invalid, 7428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 6915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:49:57,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 17695 Invalid, 7428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 6915 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 07:49:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-02-08 07:49:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2632. [2025-02-08 07:49:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 1853 states have (on average 1.8310847274689692) internal successors, (3393), 2623 states have internal predecessors, (3393), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:49:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3902 transitions. [2025-02-08 07:49:57,175 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3902 transitions. Word has length 96 [2025-02-08 07:49:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:49:57,176 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3902 transitions. [2025-02-08 07:49:57,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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) [2025-02-08 07:49:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3902 transitions. [2025-02-08 07:49:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 07:49:57,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:49:57,177 INFO L218 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] [2025-02-08 07:49:57,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:49:57,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:49:57,381 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:49:57,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:49:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash 651541448, now seen corresponding path program 1 times [2025-02-08 07:49:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:49:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488449021] [2025-02-08 07:49:57,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:49:57,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 07:49:57,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 07:49:57,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:57,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:49:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488449021] [2025-02-08 07:49:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488449021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472138305] [2025-02-08 07:49:58,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:49:58,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:49:58,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:49:58,195 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:49:58,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:49:58,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 07:49:58,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 07:49:58,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:49:58,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:49:58,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 07:49:58,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:49:58,432 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 [2025-02-08 07:49:58,533 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:49:58,533 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 [2025-02-08 07:49:58,537 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 [2025-02-08 07:49:58,545 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 [2025-02-08 07:49:58,554 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 [2025-02-08 07:49:58,592 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 [2025-02-08 07:49:58,598 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 [2025-02-08 07:49:58,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:49:58,703 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 [2025-02-08 07:49:58,708 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 [2025-02-08 07:49:58,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:49:58,765 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 [2025-02-08 07:49:58,772 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 [2025-02-08 07:49:58,787 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 [2025-02-08 07:49:58,791 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 [2025-02-08 07:49:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:49:58,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:49:58,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1175 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:49:58,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1175 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:49:58,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1181))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1182) .cse0 v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1176) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1182) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-02-08 07:49:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472138305] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:49:58,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:49:58,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-02-08 07:49:58,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513670921] [2025-02-08 07:49:58,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:49:58,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:49:58,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:49:58,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:49:58,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-02-08 07:49:58,919 INFO L87 Difference]: Start difference. First operand 2632 states and 3902 transitions. Second operand has 16 states, 14 states have (on average 10.285714285714286) internal successors, (144), 16 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:50:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:01,564 INFO L93 Difference]: Finished difference Result 2634 states and 3906 transitions. [2025-02-08 07:50:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:50:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 10.285714285714286) internal successors, (144), 16 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2025-02-08 07:50:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:01,571 INFO L225 Difference]: With dead ends: 2634 [2025-02-08 07:50:01,571 INFO L226 Difference]: Without dead ends: 2634 [2025-02-08 07:50:01,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2025-02-08 07:50:01,573 INFO L435 NwaCegarLoop]: 2083 mSDtfsCounter, 1866 mSDsluCounter, 12975 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 1019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 15058 SdHoareTripleChecker+Invalid, 6135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1019 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:01,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 15058 Invalid, 6135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1019 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 07:50:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-08 07:50:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2622. [2025-02-08 07:50:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1845 states have (on average 1.8336043360433605) internal successors, (3383), 2614 states have internal predecessors, (3383), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3891 transitions. [2025-02-08 07:50:01,605 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3891 transitions. Word has length 96 [2025-02-08 07:50:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:01,605 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 3891 transitions. [2025-02-08 07:50:01,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 10.285714285714286) internal successors, (144), 16 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:50:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3891 transitions. [2025-02-08 07:50:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:50:01,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:01,606 INFO L218 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] [2025-02-08 07:50:01,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 07:50:01,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 07:50:01,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:50:01,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash -908405408, now seen corresponding path program 1 times [2025-02-08 07:50:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500665199] [2025-02-08 07:50:01,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:01,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:50:01,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:50:01,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:01,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:02,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500665199] [2025-02-08 07:50:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500665199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:02,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:02,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 07:50:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954272579] [2025-02-08 07:50:02,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:02,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:50:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:02,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:50:02,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:50:02,317 INFO L87 Difference]: Start difference. First operand 2622 states and 3891 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:04,773 INFO L93 Difference]: Finished difference Result 2638 states and 3910 transitions. [2025-02-08 07:50:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:50:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-08 07:50:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:04,776 INFO L225 Difference]: With dead ends: 2638 [2025-02-08 07:50:04,776 INFO L226 Difference]: Without dead ends: 2638 [2025-02-08 07:50:04,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-08 07:50:04,777 INFO L435 NwaCegarLoop]: 2080 mSDtfsCounter, 1900 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 5653 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 14562 SdHoareTripleChecker+Invalid, 6167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 5653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:04,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 14562 Invalid, 6167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 5653 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 07:50:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2025-02-08 07:50:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2634. [2025-02-08 07:50:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 1856 states have (on average 1.8297413793103448) internal successors, (3396), 2625 states have internal predecessors, (3396), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3905 transitions. [2025-02-08 07:50:04,806 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3905 transitions. Word has length 98 [2025-02-08 07:50:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:04,806 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3905 transitions. [2025-02-08 07:50:04,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3905 transitions. [2025-02-08 07:50:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:50:04,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:04,807 INFO L218 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] [2025-02-08 07:50:04,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 07:50:04,807 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:50:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash -908405407, now seen corresponding path program 1 times [2025-02-08 07:50:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:04,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415780755] [2025-02-08 07:50:04,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:04,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:04,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:50:04,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:50:04,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:04,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415780755] [2025-02-08 07:50:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415780755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:05,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 07:50:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934559819] [2025-02-08 07:50:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:05,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:50:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:05,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:50:05,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:50:05,433 INFO L87 Difference]: Start difference. First operand 2634 states and 3905 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:07,993 INFO L93 Difference]: Finished difference Result 2637 states and 3909 transitions. [2025-02-08 07:50:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:50:07,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-08 07:50:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:07,997 INFO L225 Difference]: With dead ends: 2637 [2025-02-08 07:50:07,997 INFO L226 Difference]: Without dead ends: 2637 [2025-02-08 07:50:07,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:50:07,997 INFO L435 NwaCegarLoop]: 2084 mSDtfsCounter, 1894 mSDsluCounter, 15325 mSDsCounter, 0 mSdLazyCounter, 4725 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 17409 SdHoareTripleChecker+Invalid, 5237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 4725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:07,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 17409 Invalid, 5237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 4725 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 07:50:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-02-08 07:50:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2634. [2025-02-08 07:50:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 1856 states have (on average 1.8292025862068966) internal successors, (3395), 2625 states have internal predecessors, (3395), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3904 transitions. [2025-02-08 07:50:08,034 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3904 transitions. Word has length 98 [2025-02-08 07:50:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:08,035 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3904 transitions. [2025-02-08 07:50:08,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3904 transitions. [2025-02-08 07:50:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 07:50:08,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:08,037 INFO L218 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] [2025-02-08 07:50:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 07:50:08,037 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:50:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1117886715, now seen corresponding path program 1 times [2025-02-08 07:50:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644731676] [2025-02-08 07:50:08,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:08,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 07:50:08,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 07:50:08,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:08,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:08,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644731676] [2025-02-08 07:50:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644731676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960647045] [2025-02-08 07:50:08,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:08,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:08,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:50:08,572 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:50:08,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:50:08,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 07:50:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 07:50:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:08,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 07:50:08,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:50:08,820 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 [2025-02-08 07:50:08,921 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:50:08,921 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 [2025-02-08 07:50:08,948 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 [2025-02-08 07:50:09,030 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 [2025-02-08 07:50:09,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:09,167 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 [2025-02-08 07:50:09,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:09,240 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 [2025-02-08 07:50:09,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:09,301 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 [2025-02-08 07:50:09,316 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 [2025-02-08 07:50:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:09,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:50:09,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1487))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:50:09,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1491 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1491))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1487)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:50:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960647045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:09,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:50:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-08 07:50:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418488127] [2025-02-08 07:50:09,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:50:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:50:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:09,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:50:09,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=578, Unknown=25, NotChecked=102, Total=812 [2025-02-08 07:50:09,477 INFO L87 Difference]: Start difference. First operand 2634 states and 3904 transitions. Second operand has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 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) [2025-02-08 07:50:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:14,083 INFO L93 Difference]: Finished difference Result 2636 states and 3908 transitions. [2025-02-08 07:50:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:50:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 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 99 [2025-02-08 07:50:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:14,085 INFO L225 Difference]: With dead ends: 2636 [2025-02-08 07:50:14,086 INFO L226 Difference]: Without dead ends: 2636 [2025-02-08 07:50:14,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=723, Unknown=25, NotChecked=114, Total=992 [2025-02-08 07:50:14,086 INFO L435 NwaCegarLoop]: 2079 mSDtfsCounter, 1852 mSDsluCounter, 20815 mSDsCounter, 0 mSdLazyCounter, 9076 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 22894 SdHoareTripleChecker+Invalid, 9591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 9076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:14,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 22894 Invalid, 9591 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 9076 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 07:50:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-08 07:50:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2633. [2025-02-08 07:50:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 1856 states have (on average 1.8286637931034482) internal successors, (3394), 2624 states have internal predecessors, (3394), 505 states have call successors, (505), 4 states have call predecessors, (505), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3903 transitions. [2025-02-08 07:50:14,128 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3903 transitions. Word has length 99 [2025-02-08 07:50:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:14,128 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3903 transitions. [2025-02-08 07:50:14,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 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) [2025-02-08 07:50:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3903 transitions. [2025-02-08 07:50:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 07:50:14,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:14,130 INFO L218 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] [2025-02-08 07:50:14,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 07:50:14,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 07:50:14,332 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:50:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1117886716, now seen corresponding path program 1 times [2025-02-08 07:50:14,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:14,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332327085] [2025-02-08 07:50:14,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:14,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:14,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 07:50:14,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 07:50:14,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:14,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332327085] [2025-02-08 07:50:15,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332327085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863259388] [2025-02-08 07:50:15,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:15,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:15,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:50:15,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:50:15,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:50:15,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 07:50:15,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 07:50:15,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:15,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:15,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:50:15,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:50:15,293 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 [2025-02-08 07:50:15,367 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 [2025-02-08 07:50:15,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:50:15,375 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 [2025-02-08 07:50:15,406 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 [2025-02-08 07:50:15,410 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 [2025-02-08 07:50:15,485 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 [2025-02-08 07:50:15,489 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 [2025-02-08 07:50:15,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:15,565 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 [2025-02-08 07:50:15,570 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 [2025-02-08 07:50:15,623 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:15,623 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 [2025-02-08 07:50:15,630 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 [2025-02-08 07:50:15,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:15,676 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 [2025-02-08 07:50:15,683 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 [2025-02-08 07:50:15,693 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 [2025-02-08 07:50:15,695 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 [2025-02-08 07:50:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:15,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:50:15,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1656 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:50:15,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1654))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1655) .cse0 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1655) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2025-02-08 07:50:15,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1654))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1655) .cse1 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1655) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-02-08 07:50:15,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1663))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1654))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1662) .cse0 v_ArrVal_1655) .cse1 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1663))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1662) .cse5 v_ArrVal_1655) (select (select (store .cse6 .cse5 v_ArrVal_1654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1656))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-08 07:50:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863259388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:15,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:50:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-02-08 07:50:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409994714] [2025-02-08 07:50:15,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:50:15,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:50:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:15,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:50:15,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=512, Unknown=15, NotChecked=196, Total=812 [2025-02-08 07:50:15,922 INFO L87 Difference]: Start difference. First operand 2633 states and 3903 transitions. Second operand has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 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) [2025-02-08 07:50:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:20,143 INFO L93 Difference]: Finished difference Result 2635 states and 3907 transitions. [2025-02-08 07:50:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:50:20,143 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 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 99 [2025-02-08 07:50:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:20,145 INFO L225 Difference]: With dead ends: 2635 [2025-02-08 07:50:20,145 INFO L226 Difference]: Without dead ends: 2635 [2025-02-08 07:50:20,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=16, NotChecked=244, Total=1190 [2025-02-08 07:50:20,146 INFO L435 NwaCegarLoop]: 2082 mSDtfsCounter, 1866 mSDsluCounter, 26596 mSDsCounter, 0 mSdLazyCounter, 8084 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 28678 SdHoareTripleChecker+Invalid, 9106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 8084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:20,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 28678 Invalid, 9106 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 8084 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-08 07:50:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-02-08 07:50:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2620. [2025-02-08 07:50:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 1845 states have (on average 1.832520325203252) internal successors, (3381), 2612 states have internal predecessors, (3381), 505 states have call successors, (505), 4 states have call predecessors, (505), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 3889 transitions. [2025-02-08 07:50:20,171 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 3889 transitions. Word has length 99 [2025-02-08 07:50:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:20,172 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 3889 transitions. [2025-02-08 07:50:20,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 22 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) [2025-02-08 07:50:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 3889 transitions. [2025-02-08 07:50:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 07:50:20,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:20,173 INFO L218 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] [2025-02-08 07:50:20,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 07:50:20,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 07:50:20,374 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-08 07:50:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 287265179, now seen corresponding path program 1 times [2025-02-08 07:50:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617097957] [2025-02-08 07:50:20,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:20,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 07:50:20,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 07:50:20,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:20,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617097957] [2025-02-08 07:50:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617097957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 07:50:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120102120] [2025-02-08 07:50:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:20,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:50:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:20,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:50:20,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:50:20,908 INFO L87 Difference]: Start difference. First operand 2620 states and 3889 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)