./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:30:36,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:30:36,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:30:36,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:30:36,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:30:36,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:30:36,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:30:36,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:30:36,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:30:36,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:30:36,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:30:36,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:30:36,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:30:36,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:30:36,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:30:36,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:30:36,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:30:36,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:30:36,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:30:36,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:30:36,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:30:36,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:30:36,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:30:36,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:30:36,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:30:36,139 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/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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2025-03-04 09:30:36,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:30:36,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:30:36,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:30:36,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:30:36,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:30:36,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2025-03-04 09:30:37,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9087035/060a3441e1aa466c8e5312c6f2361da5/FLAGa9bcfcad8 [2025-03-04 09:30:37,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:30:37,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2025-03-04 09:30:37,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9087035/060a3441e1aa466c8e5312c6f2361da5/FLAGa9bcfcad8 [2025-03-04 09:30:37,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9087035/060a3441e1aa466c8e5312c6f2361da5 [2025-03-04 09:30:37,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:30:37,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:30:37,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:30:37,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:30:37,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:30:37,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:30:37" (1/1) ... [2025-03-04 09:30:37,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:37, skipping insertion in model container [2025-03-04 09:30:37,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:30:37" (1/1) ... [2025-03-04 09:30:38,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:30:38,328 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,358 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,362 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,365 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,369 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,398 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,398 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,399 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,400 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:30:38,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:30:38,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:30:38,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:30:38,539 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:30:38,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38 WrapperNode [2025-03-04 09:30:38,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:30:38,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:30:38,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:30:38,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:30:38,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,612 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1274 [2025-03-04 09:30:38,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:30:38,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:30:38,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:30:38,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:30:38,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,680 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-03-04 09:30:38,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:30:38,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:30:38,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:30:38,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:30:38,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (1/1) ... [2025-03-04 09:30:38,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:30:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:30:38,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:30:38,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:30:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 09:30:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:30:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:30:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:30:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 09:30:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:30:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:30:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:30:38,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:30:38,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:30:38,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:30:40,362 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 09:30:40,449 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2025-03-04 09:30:40,449 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:30:40,510 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:30:40,511 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 09:30:40,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:30:40 BoogieIcfgContainer [2025-03-04 09:30:40,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:30:40,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:30:40,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:30:40,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:30:40,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:30:37" (1/3) ... [2025-03-04 09:30:40,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e31c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:30:40, skipping insertion in model container [2025-03-04 09:30:40,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:30:38" (2/3) ... [2025-03-04 09:30:40,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e31c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:30:40, skipping insertion in model container [2025-03-04 09:30:40,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:30:40" (3/3) ... [2025-03-04 09:30:40,518 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2025-03-04 09:30:40,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:30:40,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test2-1.i that has 6 procedures, 1081 locations, 1 initial locations, 31 loop locations, and 424 error locations. [2025-03-04 09:30:40,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:30:40,593 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;@55ed1a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:30:40,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-03-04 09:30:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 1071 states, 636 states have (on average 2.0141509433962264) internal successors, (1281), 1064 states have internal predecessors, (1281), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 09:30:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:30:40,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:40,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:30:40,605 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-03-04 09:30:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1372293, now seen corresponding path program 1 times [2025-03-04 09:30:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162306974] [2025-03-04 09:30:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:40,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:30:40,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:30:40,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:40,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:40,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162306974] [2025-03-04 09:30:40,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162306974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:40,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:30:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180097771] [2025-03-04 09:30:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:30:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:40,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:30:40,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:30:40,769 INFO L87 Difference]: Start difference. First operand has 1071 states, 636 states have (on average 2.0141509433962264) internal successors, (1281), 1064 states have internal predecessors, (1281), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:41,341 INFO L93 Difference]: Finished difference Result 1057 states and 1231 transitions. [2025-03-04 09:30:41,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:30:41,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:30:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:41,357 INFO L225 Difference]: With dead ends: 1057 [2025-03-04 09:30:41,357 INFO L226 Difference]: Without dead ends: 1055 [2025-03-04 09:30:41,358 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-03-04 09:30:41,360 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 1096 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:41,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 853 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:30:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-04 09:30:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-03-04 09:30:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 638 states have (on average 1.8981191222570533) internal successors, (1211), 1048 states have internal predecessors, (1211), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 09:30:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1229 transitions. [2025-03-04 09:30:41,435 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1229 transitions. Word has length 3 [2025-03-04 09:30:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:41,435 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1229 transitions. [2025-03-04 09:30:41,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1229 transitions. [2025-03-04 09:30:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:30:41,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:41,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:30:41,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:30:41,436 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-03-04 09:30:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1372294, now seen corresponding path program 1 times [2025-03-04 09:30:41,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:41,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784702165] [2025-03-04 09:30:41,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:41,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:41,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:30:41,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:30:41,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:41,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784702165] [2025-03-04 09:30:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784702165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:41,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:41,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:30:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144511246] [2025-03-04 09:30:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:41,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:30:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:41,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:30:41,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:30:41,507 INFO L87 Difference]: Start difference. First operand 1055 states and 1229 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:42,259 INFO L93 Difference]: Finished difference Result 1825 states and 2161 transitions. [2025-03-04 09:30:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:30:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:30:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:42,266 INFO L225 Difference]: With dead ends: 1825 [2025-03-04 09:30:42,266 INFO L226 Difference]: Without dead ends: 1825 [2025-03-04 09:30:42,267 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-03-04 09:30:42,268 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 914 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:42,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1652 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:30:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-03-04 09:30:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1561. [2025-03-04 09:30:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1140 states have (on average 1.8587719298245613) internal successors, (2119), 1552 states have internal predecessors, (2119), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2151 transitions. [2025-03-04 09:30:42,312 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2151 transitions. Word has length 3 [2025-03-04 09:30:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:42,313 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2151 transitions. [2025-03-04 09:30:42,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2151 transitions. [2025-03-04 09:30:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:30:42,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:42,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:30:42,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:30:42,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:42,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1523388682, now seen corresponding path program 1 times [2025-03-04 09:30:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826454335] [2025-03-04 09:30:42,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:30:42,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:30:42,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:42,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:42,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826454335] [2025-03-04 09:30:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826454335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:42,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:42,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:30:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975177987] [2025-03-04 09:30:42,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:42,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:30:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:30:42,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:30:42,383 INFO L87 Difference]: Start difference. First operand 1561 states and 2151 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-03-04 09:30:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:42,954 INFO L93 Difference]: Finished difference Result 1832 states and 2486 transitions. [2025-03-04 09:30:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:30:42,955 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-03-04 09:30:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:42,960 INFO L225 Difference]: With dead ends: 1832 [2025-03-04 09:30:42,960 INFO L226 Difference]: Without dead ends: 1832 [2025-03-04 09:30:42,961 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-03-04 09:30:42,961 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 1081 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:42,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1413 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:30:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-03-04 09:30:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1514. [2025-03-04 09:30:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1140 states have (on average 1.7964912280701755) internal successors, (2048), 1505 states have internal predecessors, (2048), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2080 transitions. [2025-03-04 09:30:42,988 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2080 transitions. Word has length 8 [2025-03-04 09:30:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:42,988 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2080 transitions. [2025-03-04 09:30:42,988 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-03-04 09:30:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2080 transitions. [2025-03-04 09:30:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:30:42,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:42,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:30:42,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:30:42,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:42,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1523388681, now seen corresponding path program 1 times [2025-03-04 09:30:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:42,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652487155] [2025-03-04 09:30:42,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:42,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:30:43,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:30:43,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:43,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:43,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652487155] [2025-03-04 09:30:43,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652487155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:43,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:43,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:30:43,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972737501] [2025-03-04 09:30:43,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:43,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:30:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:43,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:30:43,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:30:43,089 INFO L87 Difference]: Start difference. First operand 1514 states and 2080 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-03-04 09:30:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:43,660 INFO L93 Difference]: Finished difference Result 2050 states and 2852 transitions. [2025-03-04 09:30:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:30:43,661 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-03-04 09:30:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:43,667 INFO L225 Difference]: With dead ends: 2050 [2025-03-04 09:30:43,667 INFO L226 Difference]: Without dead ends: 2050 [2025-03-04 09:30:43,668 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-03-04 09:30:43,669 INFO L435 NwaCegarLoop]: 1239 mSDtfsCounter, 874 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:43,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1656 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:30:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-03-04 09:30:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1489. [2025-03-04 09:30:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1140 states have (on average 1.7535087719298246) internal successors, (1999), 1480 states have internal predecessors, (1999), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2031 transitions. [2025-03-04 09:30:43,702 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2031 transitions. Word has length 8 [2025-03-04 09:30:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:43,702 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 2031 transitions. [2025-03-04 09:30:43,702 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-03-04 09:30:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2031 transitions. [2025-03-04 09:30:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 09:30:43,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:43,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:30:43,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:30:43,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:43,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash -238160579, now seen corresponding path program 1 times [2025-03-04 09:30:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:43,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356705610] [2025-03-04 09:30:43,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:43,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:43,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:30:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:30:43,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:43,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356705610] [2025-03-04 09:30:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356705610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:43,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:30:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763339656] [2025-03-04 09:30:43,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:43,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:30:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:43,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:30:43,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:30:43,773 INFO L87 Difference]: Start difference. First operand 1489 states and 2031 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:43,986 INFO L93 Difference]: Finished difference Result 2666 states and 3562 transitions. [2025-03-04 09:30:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:30:43,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 09:30:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:43,994 INFO L225 Difference]: With dead ends: 2666 [2025-03-04 09:30:43,994 INFO L226 Difference]: Without dead ends: 2666 [2025-03-04 09:30:43,994 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-03-04 09:30:43,994 INFO L435 NwaCegarLoop]: 1064 mSDtfsCounter, 1095 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:43,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 3172 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:30:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2025-03-04 09:30:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1491. [2025-03-04 09:30:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1142 states have (on average 1.7521891418563922) internal successors, (2001), 1482 states have internal predecessors, (2001), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2033 transitions. [2025-03-04 09:30:44,021 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2033 transitions. Word has length 10 [2025-03-04 09:30:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:44,021 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 2033 transitions. [2025-03-04 09:30:44,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2033 transitions. [2025-03-04 09:30:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:30:44,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:44,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:30:44,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:30:44,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -888004907, now seen corresponding path program 1 times [2025-03-04 09:30:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438446922] [2025-03-04 09:30:44,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:44,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:30:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:30:44,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:44,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:44,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438446922] [2025-03-04 09:30:44,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438446922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:44,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:30:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125482749] [2025-03-04 09:30:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:44,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:30:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:44,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:30:44,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:30:44,073 INFO L87 Difference]: Start difference. First operand 1491 states and 2033 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:44,652 INFO L93 Difference]: Finished difference Result 1566 states and 2139 transitions. [2025-03-04 09:30:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:30:44,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 09:30:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:44,657 INFO L225 Difference]: With dead ends: 1566 [2025-03-04 09:30:44,657 INFO L226 Difference]: Without dead ends: 1566 [2025-03-04 09:30:44,657 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-03-04 09:30:44,658 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1346 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:44,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 1276 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:30:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-04 09:30:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1468. [2025-03-04 09:30:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1142 states have (on average 1.7119089316987741) internal successors, (1955), 1459 states have internal predecessors, (1955), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1987 transitions. [2025-03-04 09:30:44,688 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1987 transitions. Word has length 17 [2025-03-04 09:30:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:44,688 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1987 transitions. [2025-03-04 09:30:44,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1987 transitions. [2025-03-04 09:30:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:30:44,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:44,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:30:44,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:30:44,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:44,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash -888004906, now seen corresponding path program 1 times [2025-03-04 09:30:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625931842] [2025-03-04 09:30:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:44,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:30:44,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:30:44,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:44,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:44,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-03-04 09:30:44,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625931842] [2025-03-04 09:30:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625931842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:44,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:30:44,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002963551] [2025-03-04 09:30:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:44,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:30:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:44,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:30:44,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:30:44,747 INFO L87 Difference]: Start difference. First operand 1468 states and 1987 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:44,802 INFO L93 Difference]: Finished difference Result 1330 states and 1781 transitions. [2025-03-04 09:30:44,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:30:44,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 09:30:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:44,806 INFO L225 Difference]: With dead ends: 1330 [2025-03-04 09:30:44,806 INFO L226 Difference]: Without dead ends: 1330 [2025-03-04 09:30:44,806 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-03-04 09:30:44,806 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 60 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1903 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:44,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1903 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:30:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-04 09:30:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2025-03-04 09:30:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1016 states have (on average 1.7214566929133859) internal successors, (1749), 1321 states have internal predecessors, (1749), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1781 transitions. [2025-03-04 09:30:44,824 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1781 transitions. Word has length 17 [2025-03-04 09:30:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:44,824 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1781 transitions. [2025-03-04 09:30:44,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1781 transitions. [2025-03-04 09:30:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:30:44,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:44,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:30:44,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:30:44,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:44,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1758472147, now seen corresponding path program 1 times [2025-03-04 09:30:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:44,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665364559] [2025-03-04 09:30:44,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:44,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:30:44,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:30:44,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:44,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665364559] [2025-03-04 09:30:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665364559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:30:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913943549] [2025-03-04 09:30:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:44,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:30:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:44,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:30:44,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:30:44,877 INFO L87 Difference]: Start difference. First operand 1330 states and 1781 transitions. Second operand has 4 states, 4 states have (on average 4.5) 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-03-04 09:30:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:44,965 INFO L93 Difference]: Finished difference Result 1301 states and 1731 transitions. [2025-03-04 09:30:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:30:44,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) 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-03-04 09:30:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:44,968 INFO L225 Difference]: With dead ends: 1301 [2025-03-04 09:30:44,968 INFO L226 Difference]: Without dead ends: 1301 [2025-03-04 09:30:44,969 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-03-04 09:30:44,969 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 41 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2801 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-03-04 09:30:44,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2801 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:30:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2025-03-04 09:30:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1295. [2025-03-04 09:30:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 988 states have (on average 1.7135627530364372) internal successors, (1693), 1286 states have internal predecessors, (1693), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1725 transitions. [2025-03-04 09:30:44,996 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1725 transitions. Word has length 18 [2025-03-04 09:30:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:44,996 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1725 transitions. [2025-03-04 09:30:44,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) 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-03-04 09:30:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1725 transitions. [2025-03-04 09:30:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 09:30:44,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:44,997 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] [2025-03-04 09:30:44,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:30:44,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:44,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1274587005, now seen corresponding path program 1 times [2025-03-04 09:30:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:44,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696241970] [2025-03-04 09:30:44,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:45,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 09:30:45,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 09:30:45,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:45,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696241970] [2025-03-04 09:30:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696241970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:45,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:30:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191338752] [2025-03-04 09:30:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:45,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:30:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:45,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:30:45,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:30:45,152 INFO L87 Difference]: Start difference. First operand 1295 states and 1725 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-03-04 09:30:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:45,809 INFO L93 Difference]: Finished difference Result 2085 states and 2870 transitions. [2025-03-04 09:30:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:30:45,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2025-03-04 09:30:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:45,815 INFO L225 Difference]: With dead ends: 2085 [2025-03-04 09:30:45,815 INFO L226 Difference]: Without dead ends: 2085 [2025-03-04 09:30:45,815 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-03-04 09:30:45,816 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 824 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:45,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1822 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:30:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-04 09:30:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1291. [2025-03-04 09:30:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 988 states have (on average 1.7054655870445343) internal successors, (1685), 1282 states have internal predecessors, (1685), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1717 transitions. [2025-03-04 09:30:45,857 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1717 transitions. Word has length 32 [2025-03-04 09:30:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:45,858 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1717 transitions. [2025-03-04 09:30:45,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-03-04 09:30:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1717 transitions. [2025-03-04 09:30:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 09:30:45,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:45,861 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] [2025-03-04 09:30:45,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:30:45,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:45,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:45,862 INFO L85 PathProgramCache]: Analyzing trace with hash 816975703, now seen corresponding path program 1 times [2025-03-04 09:30:45,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166328637] [2025-03-04 09:30:45,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:45,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:45,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 09:30:45,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 09:30:45,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:45,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166328637] [2025-03-04 09:30:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166328637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:45,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:30:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418604566] [2025-03-04 09:30:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:30:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:45,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:30:45,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:30:45,957 INFO L87 Difference]: Start difference. First operand 1291 states and 1717 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:46,041 INFO L93 Difference]: Finished difference Result 1291 states and 1709 transitions. [2025-03-04 09:30:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:30:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 09:30:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:46,047 INFO L225 Difference]: With dead ends: 1291 [2025-03-04 09:30:46,047 INFO L226 Difference]: Without dead ends: 1291 [2025-03-04 09:30:46,047 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-03-04 09:30:46,048 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 21 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2783 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-03-04 09:30:46,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2783 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:30:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-04 09:30:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-03-04 09:30:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 988 states have (on average 1.6973684210526316) internal successors, (1677), 1282 states have internal predecessors, (1677), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:30:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1709 transitions. [2025-03-04 09:30:46,067 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1709 transitions. Word has length 66 [2025-03-04 09:30:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:46,067 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1709 transitions. [2025-03-04 09:30:46,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1709 transitions. [2025-03-04 09:30:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 09:30:46,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:46,068 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] [2025-03-04 09:30:46,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:30:46,068 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-03-04 09:30:46,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1585653407, now seen corresponding path program 1 times [2025-03-04 09:30:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:46,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251286121] [2025-03-04 09:30:46,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:46,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 09:30:46,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 09:30:46,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:46,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251286121] [2025-03-04 09:30:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251286121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:46,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:30:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704303830] [2025-03-04 09:30:46,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:46,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:30:46,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:46,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:30:46,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:30:46,184 INFO L87 Difference]: Start difference. First operand 1291 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:46,287 INFO L93 Difference]: Finished difference Result 1815 states and 2465 transitions. [2025-03-04 09:30:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:30:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-04 09:30:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:46,292 INFO L225 Difference]: With dead ends: 1815 [2025-03-04 09:30:46,292 INFO L226 Difference]: Without dead ends: 1815 [2025-03-04 09:30:46,292 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-03-04 09:30:46,293 INFO L435 NwaCegarLoop]: 1213 mSDtfsCounter, 362 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 2120 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-03-04 09:30:46,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 2120 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:30:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-03-04 09:30:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1758. [2025-03-04 09:30:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1445 states have (on average 1.6678200692041523) internal successors, (2410), 1749 states have internal predecessors, (2410), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:30:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2462 transitions. [2025-03-04 09:30:46,312 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2462 transitions. Word has length 74 [2025-03-04 09:30:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:46,312 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2462 transitions. [2025-03-04 09:30:46,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:30:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2462 transitions. [2025-03-04 09:30:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 09:30:46,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:46,315 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] [2025-03-04 09:30:46,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:30:46,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash 376375084, now seen corresponding path program 1 times [2025-03-04 09:30:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317921589] [2025-03-04 09:30:46,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:46,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 09:30:46,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 09:30:46,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:46,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317921589] [2025-03-04 09:30:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317921589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:46,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:46,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:30:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767963760] [2025-03-04 09:30:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:46,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:30:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:46,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:30:46,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:30:46,760 INFO L87 Difference]: Start difference. First operand 1758 states and 2462 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-03-04 09:30:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:47,383 INFO L93 Difference]: Finished difference Result 1757 states and 2460 transitions. [2025-03-04 09:30:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:30:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-04 09:30:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:47,388 INFO L225 Difference]: With dead ends: 1757 [2025-03-04 09:30:47,388 INFO L226 Difference]: Without dead ends: 1757 [2025-03-04 09:30:47,389 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-03-04 09:30:47,391 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 2 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:47,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2739 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:30:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2025-03-04 09:30:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2025-03-04 09:30:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1445 states have (on average 1.6664359861591695) internal successors, (2408), 1748 states have internal predecessors, (2408), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:30:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2460 transitions. [2025-03-04 09:30:47,415 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2460 transitions. Word has length 82 [2025-03-04 09:30:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:47,416 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2460 transitions. [2025-03-04 09:30:47,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-03-04 09:30:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2460 transitions. [2025-03-04 09:30:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 09:30:47,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:47,417 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] [2025-03-04 09:30:47,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:30:47,418 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-03-04 09:30:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 376375083, now seen corresponding path program 1 times [2025-03-04 09:30:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938558340] [2025-03-04 09:30:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:47,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 09:30:47,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 09:30:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938558340] [2025-03-04 09:30:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938558340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:30:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547770215] [2025-03-04 09:30:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:30:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:47,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:30:47,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:30:47,621 INFO L87 Difference]: Start difference. First operand 1757 states and 2460 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-03-04 09:30:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:48,121 INFO L93 Difference]: Finished difference Result 1756 states and 2458 transitions. [2025-03-04 09:30:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:30:48,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-04 09:30:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:48,125 INFO L225 Difference]: With dead ends: 1756 [2025-03-04 09:30:48,126 INFO L226 Difference]: Without dead ends: 1756 [2025-03-04 09:30:48,126 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-03-04 09:30:48,126 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 1 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2801 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.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:48,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2801 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:30:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-03-04 09:30:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1756. [2025-03-04 09:30:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1443 states have (on average 1.6673596673596673) internal successors, (2406), 1747 states have internal predecessors, (2406), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:30:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2458 transitions. [2025-03-04 09:30:48,143 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2458 transitions. Word has length 82 [2025-03-04 09:30:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:48,143 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2458 transitions. [2025-03-04 09:30:48,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-03-04 09:30:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2458 transitions. [2025-03-04 09:30:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:30:48,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:48,144 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] [2025-03-04 09:30:48,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:30:48,144 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:48,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash 560602536, now seen corresponding path program 1 times [2025-03-04 09:30:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:48,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943776526] [2025-03-04 09:30:48,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:48,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:30:48,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:30:48,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:48,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943776526] [2025-03-04 09:30:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943776526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:30:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003158537] [2025-03-04 09:30:48,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:48,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:30:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:48,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:30:48,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:30:48,330 INFO L87 Difference]: Start difference. First operand 1756 states and 2458 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 09:30:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:48,965 INFO L93 Difference]: Finished difference Result 1774 states and 2484 transitions. [2025-03-04 09:30:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:30:48,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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 90 [2025-03-04 09:30:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:48,973 INFO L225 Difference]: With dead ends: 1774 [2025-03-04 09:30:48,973 INFO L226 Difference]: Without dead ends: 1774 [2025-03-04 09:30:48,973 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-03-04 09:30:48,974 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 13 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:48,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3735 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:30:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-04 09:30:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1765. [2025-03-04 09:30:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1451 states have (on average 1.6657477601654032) internal successors, (2417), 1754 states have internal predecessors, (2417), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2025-03-04 09:30:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2474 transitions. [2025-03-04 09:30:48,996 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2474 transitions. Word has length 90 [2025-03-04 09:30:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:48,996 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2474 transitions. [2025-03-04 09:30:48,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 09:30:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2474 transitions. [2025-03-04 09:30:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:30:48,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:48,997 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] [2025-03-04 09:30:48,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:30:48,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash 560602537, now seen corresponding path program 1 times [2025-03-04 09:30:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:48,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724237908] [2025-03-04 09:30:48,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:49,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:30:49,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:30:49,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:49,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:49,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724237908] [2025-03-04 09:30:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724237908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:49,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:30:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934055635] [2025-03-04 09:30:49,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:49,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:30:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:49,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:30:49,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:30:49,397 INFO L87 Difference]: Start difference. First operand 1765 states and 2474 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 09:30:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:50,152 INFO L93 Difference]: Finished difference Result 1765 states and 2472 transitions. [2025-03-04 09:30:50,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:30:50,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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 90 [2025-03-04 09:30:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:50,157 INFO L225 Difference]: With dead ends: 1765 [2025-03-04 09:30:50,157 INFO L226 Difference]: Without dead ends: 1765 [2025-03-04 09:30:50,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:30:50,157 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 8 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:50,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3502 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:30:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-03-04 09:30:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2025-03-04 09:30:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1451 states have (on average 1.664369400413508) internal successors, (2415), 1754 states have internal predecessors, (2415), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2025-03-04 09:30:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2472 transitions. [2025-03-04 09:30:50,179 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2472 transitions. Word has length 90 [2025-03-04 09:30:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:50,179 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2472 transitions. [2025-03-04 09:30:50,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-03-04 09:30:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2472 transitions. [2025-03-04 09:30:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:30:50,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:50,180 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] [2025-03-04 09:30:50,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:30:50,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2014836733, now seen corresponding path program 1 times [2025-03-04 09:30:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:50,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675514366] [2025-03-04 09:30:50,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:50,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:30:50,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:30:50,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:50,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675514366] [2025-03-04 09:30:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675514366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761154455] [2025-03-04 09:30:50,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:50,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:30:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:30:50,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:30:50,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:30:50,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:30:50,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:30:50,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:50,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:50,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:30:50,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:30:50,758 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-03-04 09:30:50,859 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:30:50,859 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-03-04 09:30:50,888 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-03-04 09:30:50,959 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-03-04 09:30:51,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:51,083 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-03-04 09:30:51,120 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-03-04 09:30:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:51,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:30:51,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:30:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761154455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:51,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:30:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-03-04 09:30:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157986416] [2025-03-04 09:30:51,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:30:51,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:30:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:51,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:30:51,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-03-04 09:30:51,174 INFO L87 Difference]: Start difference. First operand 1765 states and 2472 transitions. Second operand has 19 states, 16 states have (on average 8.9375) internal successors, (143), 18 states have internal predecessors, (143), 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-03-04 09:30:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:53,218 INFO L93 Difference]: Finished difference Result 1772 states and 2478 transitions. [2025-03-04 09:30:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:30:53,218 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.9375) internal successors, (143), 18 states have internal predecessors, (143), 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 91 [2025-03-04 09:30:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:53,225 INFO L225 Difference]: With dead ends: 1772 [2025-03-04 09:30:53,227 INFO L226 Difference]: Without dead ends: 1772 [2025-03-04 09:30:53,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-03-04 09:30:53,228 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 877 mSDsluCounter, 6360 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 6960 SdHoareTripleChecker+Invalid, 4844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:53,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 6960 Invalid, 4844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:30:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-04 09:30:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1769. [2025-03-04 09:30:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1455 states have (on average 1.6618556701030929) internal successors, (2418), 1757 states have internal predecessors, (2418), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:30:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2472 transitions. [2025-03-04 09:30:53,262 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2472 transitions. Word has length 91 [2025-03-04 09:30:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:53,262 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2472 transitions. [2025-03-04 09:30:53,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.9375) internal successors, (143), 18 states have internal predecessors, (143), 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-03-04 09:30:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2472 transitions. [2025-03-04 09:30:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:30:53,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:53,263 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] [2025-03-04 09:30:53,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:30:53,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 09:30:53,464 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:53,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2014836732, now seen corresponding path program 1 times [2025-03-04 09:30:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:53,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600649385] [2025-03-04 09:30:53,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:53,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:30:53,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:30:53,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600649385] [2025-03-04 09:30:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600649385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403470669] [2025-03-04 09:30:53,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:53,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:30:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:30:53,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:30:53,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:30:54,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:30:54,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:30:54,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:54,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:54,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 09:30:54,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:30:54,104 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-03-04 09:30:54,181 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-03-04 09:30:54,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:30:54,188 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-03-04 09:30:54,215 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-03-04 09:30:54,218 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-03-04 09:30:54,297 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-03-04 09:30:54,301 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-03-04 09:30:54,415 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:30:54,415 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-03-04 09:30:54,423 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-03-04 09:30:54,450 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-03-04 09:30:54,456 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-03-04 09:30:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:54,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:30:54,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |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_729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_730 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:30:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403470669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:30:54,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:30:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-03-04 09:30:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675494882] [2025-03-04 09:30:54,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:30:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:30:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:54,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:30:54,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-03-04 09:30:54,549 INFO L87 Difference]: Start difference. First operand 1769 states and 2472 transitions. Second operand has 18 states, 15 states have (on average 9.533333333333333) internal successors, (143), 18 states have internal predecessors, (143), 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-03-04 09:30:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:57,315 INFO L93 Difference]: Finished difference Result 1771 states and 2476 transitions. [2025-03-04 09:30:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:30:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.533333333333333) internal successors, (143), 18 states have internal predecessors, (143), 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 91 [2025-03-04 09:30:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:57,318 INFO L225 Difference]: With dead ends: 1771 [2025-03-04 09:30:57,319 INFO L226 Difference]: Without dead ends: 1771 [2025-03-04 09:30:57,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-03-04 09:30:57,319 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 877 mSDsluCounter, 6233 mSDsCounter, 0 mSdLazyCounter, 6879 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 6836 SdHoareTripleChecker+Invalid, 6902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:57,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 6836 Invalid, 6902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6879 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 09:30:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-03-04 09:30:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1759. [2025-03-04 09:30:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1447 states have (on average 1.663441603317208) internal successors, (2407), 1749 states have internal predecessors, (2407), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:30:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2459 transitions. [2025-03-04 09:30:57,337 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2459 transitions. Word has length 91 [2025-03-04 09:30:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:57,337 INFO L471 AbstractCegarLoop]: Abstraction has 1759 states and 2459 transitions. [2025-03-04 09:30:57,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.533333333333333) internal successors, (143), 18 states have internal predecessors, (143), 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-03-04 09:30:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2459 transitions. [2025-03-04 09:30:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:30:57,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:57,338 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-03-04 09:30:57,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:30:57,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:30:57,543 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:57,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2078200701, now seen corresponding path program 1 times [2025-03-04 09:30:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:57,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223201061] [2025-03-04 09:30:57,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:30:57,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:30:57,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:57,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:57,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223201061] [2025-03-04 09:30:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223201061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:30:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936602259] [2025-03-04 09:30:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:57,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:30:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:57,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:30:57,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:30:57,895 INFO L87 Difference]: Start difference. First operand 1759 states and 2459 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-03-04 09:30:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:30:59,128 INFO L93 Difference]: Finished difference Result 1778 states and 2484 transitions. [2025-03-04 09:30:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:30:59,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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 93 [2025-03-04 09:30:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:30:59,131 INFO L225 Difference]: With dead ends: 1778 [2025-03-04 09:30:59,131 INFO L226 Difference]: Without dead ends: 1778 [2025-03-04 09:30:59,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-04 09:30:59,132 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 907 mSDsluCounter, 4646 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:30:59,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 5246 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:30:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2025-03-04 09:30:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1774. [2025-03-04 09:30:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1461 states have (on average 1.6591375770020533) internal successors, (2424), 1762 states have internal predecessors, (2424), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:30:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2478 transitions. [2025-03-04 09:30:59,147 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2478 transitions. Word has length 93 [2025-03-04 09:30:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:30:59,147 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2478 transitions. [2025-03-04 09:30:59,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-03-04 09:30:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2478 transitions. [2025-03-04 09:30:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:30:59,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:30:59,148 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-03-04 09:30:59,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:30:59,148 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:30:59,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:30:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2078200702, now seen corresponding path program 1 times [2025-03-04 09:30:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:30:59,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178530012] [2025-03-04 09:30:59,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:30:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:30:59,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:30:59,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:30:59,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:30:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:30:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:30:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:30:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178530012] [2025-03-04 09:30:59,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178530012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:30:59,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:30:59,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:30:59,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045335526] [2025-03-04 09:30:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:30:59,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:30:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:30:59,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:30:59,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:30:59,580 INFO L87 Difference]: Start difference. First operand 1774 states and 2478 transitions. Second operand has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 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-03-04 09:31:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:00,811 INFO L93 Difference]: Finished difference Result 1777 states and 2482 transitions. [2025-03-04 09:31:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:31:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 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 93 [2025-03-04 09:31:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:00,814 INFO L225 Difference]: With dead ends: 1777 [2025-03-04 09:31:00,814 INFO L226 Difference]: Without dead ends: 1777 [2025-03-04 09:31:00,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:31:00,814 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 889 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:00,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 3564 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:31:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-03-04 09:31:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1774. [2025-03-04 09:31:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1461 states have (on average 1.6577686516084873) internal successors, (2422), 1762 states have internal predecessors, (2422), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2476 transitions. [2025-03-04 09:31:00,833 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2476 transitions. Word has length 93 [2025-03-04 09:31:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:00,833 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2476 transitions. [2025-03-04 09:31:00,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 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-03-04 09:31:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2476 transitions. [2025-03-04 09:31:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:31:00,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:00,834 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] [2025-03-04 09:31:00,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:31:00,835 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:00,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1832253630, now seen corresponding path program 1 times [2025-03-04 09:31:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062069774] [2025-03-04 09:31:00,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:00,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:31:00,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:31:00,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:00,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062069774] [2025-03-04 09:31:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062069774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435190387] [2025-03-04 09:31:01,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:01,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:01,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:01,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:01,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:31:01,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:31:01,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:31:01,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:01,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:01,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:31:01,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:01,365 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-03-04 09:31:01,466 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:31:01,467 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-03-04 09:31:01,493 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-03-04 09:31:01,555 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-03-04 09:31:01,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:01,660 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-03-04 09:31:01,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:01,734 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-03-04 09:31:01,749 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-03-04 09:31:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:01,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:01,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (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_1014))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1011)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:01,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435190387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:01,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:01,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-04 09:31:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304596595] [2025-03-04 09:31:01,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:01,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:31:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:01,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:31:01,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=453, Unknown=21, NotChecked=44, Total=600 [2025-03-04 09:31:01,864 INFO L87 Difference]: Start difference. First operand 1774 states and 2476 transitions. Second operand has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 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-03-04 09:31:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:03,885 INFO L93 Difference]: Finished difference Result 1776 states and 2480 transitions. [2025-03-04 09:31:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:31:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 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 94 [2025-03-04 09:31:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:03,888 INFO L225 Difference]: With dead ends: 1776 [2025-03-04 09:31:03,888 INFO L226 Difference]: Without dead ends: 1776 [2025-03-04 09:31:03,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=580, Unknown=22, NotChecked=50, Total=756 [2025-03-04 09:31:03,888 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 872 mSDsluCounter, 7486 mSDsCounter, 0 mSdLazyCounter, 5627 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 8085 SdHoareTripleChecker+Invalid, 5647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:03,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 8085 Invalid, 5647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5627 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:31:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2025-03-04 09:31:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1773. [2025-03-04 09:31:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1461 states have (on average 1.6563997262149213) internal successors, (2420), 1761 states have internal predecessors, (2420), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2474 transitions. [2025-03-04 09:31:03,902 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2474 transitions. Word has length 94 [2025-03-04 09:31:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:03,904 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2474 transitions. [2025-03-04 09:31:03,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 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-03-04 09:31:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2474 transitions. [2025-03-04 09:31:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:31:03,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:03,904 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] [2025-03-04 09:31:03,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:31:04,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:04,105 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1832253629, now seen corresponding path program 1 times [2025-03-04 09:31:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756548102] [2025-03-04 09:31:04,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:04,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:31:04,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:31:04,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756548102] [2025-03-04 09:31:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756548102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432428213] [2025-03-04 09:31:04,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:04,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:04,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:04,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:04,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:31:04,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:31:04,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:31:04,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:04,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:04,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 09:31:04,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:04,797 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-03-04 09:31:04,871 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-03-04 09:31:04,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:31:04,877 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-03-04 09:31:04,898 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-03-04 09:31:04,905 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-03-04 09:31:04,962 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-03-04 09:31:04,965 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-03-04 09:31:05,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:05,048 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-03-04 09:31:05,054 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-03-04 09:31:05,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:05,111 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-03-04 09:31:05,116 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-03-04 09:31:05,127 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-03-04 09:31:05,131 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-03-04 09:31:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:05,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:05,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1165 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-04 09:31:05,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1171))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172) .cse1 v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:31:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432428213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:05,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-04 09:31:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008918367] [2025-03-04 09:31:05,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:05,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:31:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:05,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:31:05,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=420, Unknown=16, NotChecked=86, Total=600 [2025-03-04 09:31:05,276 INFO L87 Difference]: Start difference. First operand 1773 states and 2474 transitions. Second operand has 20 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 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-03-04 09:31:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:07,633 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2025-03-04 09:31:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:31:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 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 94 [2025-03-04 09:31:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:07,636 INFO L225 Difference]: With dead ends: 1775 [2025-03-04 09:31:07,636 INFO L226 Difference]: Without dead ends: 1775 [2025-03-04 09:31:07,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=623, Unknown=16, NotChecked=106, Total=870 [2025-03-04 09:31:07,637 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 877 mSDsluCounter, 5888 mSDsCounter, 0 mSdLazyCounter, 6178 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 6490 SdHoareTripleChecker+Invalid, 6201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:07,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 6490 Invalid, 6201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6178 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 09:31:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2025-03-04 09:31:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1757. [2025-03-04 09:31:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1447 states have (on average 1.6606772633033864) internal successors, (2403), 1747 states have internal predecessors, (2403), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:31:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2455 transitions. [2025-03-04 09:31:07,664 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2455 transitions. Word has length 94 [2025-03-04 09:31:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:07,665 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2455 transitions. [2025-03-04 09:31:07,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 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-03-04 09:31:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2455 transitions. [2025-03-04 09:31:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:31:07,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:07,666 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-03-04 09:31:07,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:31:07,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:07,867 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:07,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash -275597727, now seen corresponding path program 1 times [2025-03-04 09:31:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:07,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334240904] [2025-03-04 09:31:07,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:07,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:31:07,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:31:07,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:07,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334240904] [2025-03-04 09:31:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334240904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 09:31:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775560404] [2025-03-04 09:31:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:31:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:08,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:31:08,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:31:08,219 INFO L87 Difference]: Start difference. First operand 1757 states and 2455 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:09,359 INFO L93 Difference]: Finished difference Result 1782 states and 2486 transitions. [2025-03-04 09:31:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:31:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-04 09:31:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:09,362 INFO L225 Difference]: With dead ends: 1782 [2025-03-04 09:31:09,362 INFO L226 Difference]: Without dead ends: 1782 [2025-03-04 09:31:09,362 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-03-04 09:31:09,363 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 910 mSDsluCounter, 4065 mSDsCounter, 0 mSdLazyCounter, 3216 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:09,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 4664 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3216 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:31:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-04 09:31:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1778. [2025-03-04 09:31:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1467 states have (on average 1.6537150647580094) internal successors, (2426), 1766 states have internal predecessors, (2426), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2480 transitions. [2025-03-04 09:31:09,375 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2480 transitions. Word has length 96 [2025-03-04 09:31:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:09,376 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2480 transitions. [2025-03-04 09:31:09,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2480 transitions. [2025-03-04 09:31:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:31:09,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:09,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-03-04 09:31:09,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:31:09,376 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:09,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -275597726, now seen corresponding path program 1 times [2025-03-04 09:31:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:09,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248984911] [2025-03-04 09:31:09,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:09,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:09,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:31:09,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:31:09,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:09,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:09,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-03-04 09:31:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:09,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248984911] [2025-03-04 09:31:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248984911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:09,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:31:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910734434] [2025-03-04 09:31:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:09,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:31:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:09,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:31:09,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:31:09,815 INFO L87 Difference]: Start difference. First operand 1778 states and 2480 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:11,392 INFO L93 Difference]: Finished difference Result 1781 states and 2484 transitions. [2025-03-04 09:31:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:31:11,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-04 09:31:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:11,395 INFO L225 Difference]: With dead ends: 1781 [2025-03-04 09:31:11,395 INFO L226 Difference]: Without dead ends: 1781 [2025-03-04 09:31:11,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:31:11,396 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 890 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 4236 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 4563 SdHoareTripleChecker+Invalid, 4253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:11,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 4563 Invalid, 4253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4236 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:31:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-04 09:31:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1778. [2025-03-04 09:31:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1467 states have (on average 1.6523517382413089) internal successors, (2424), 1766 states have internal predecessors, (2424), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2478 transitions. [2025-03-04 09:31:11,409 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2478 transitions. Word has length 96 [2025-03-04 09:31:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:11,410 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2478 transitions. [2025-03-04 09:31:11,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2478 transitions. [2025-03-04 09:31:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:31:11,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:11,410 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] [2025-03-04 09:31:11,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 09:31:11,410 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash 72364156, now seen corresponding path program 1 times [2025-03-04 09:31:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411710850] [2025-03-04 09:31:11,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:11,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:11,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:31:11,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:31:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411710850] [2025-03-04 09:31:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411710850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172436876] [2025-03-04 09:31:11,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:11,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:11,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:11,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:31:11,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:31:11,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:31:11,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:11,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:11,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:31:11,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:11,982 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-03-04 09:31:12,071 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:31:12,072 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-03-04 09:31:12,117 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-03-04 09:31:12,203 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-03-04 09:31:12,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:12,338 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-03-04 09:31:12,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:12,393 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-03-04 09:31:12,439 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:12,439 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-03-04 09:31:12,450 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-03-04 09:31:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:12,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:12,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (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_1477))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1478)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:12,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1477))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1478)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172436876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:12,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-04 09:31:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680998867] [2025-03-04 09:31:12,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:31:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:12,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:31:12,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=565, Unknown=43, NotChecked=102, Total=812 [2025-03-04 09:31:12,609 INFO L87 Difference]: Start difference. First operand 1778 states and 2478 transitions. Second operand has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 23 states have internal predecessors, (155), 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-03-04 09:31:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:14,491 INFO L93 Difference]: Finished difference Result 1780 states and 2482 transitions. [2025-03-04 09:31:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:31:14,492 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 23 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-03-04 09:31:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:14,495 INFO L225 Difference]: With dead ends: 1780 [2025-03-04 09:31:14,495 INFO L226 Difference]: Without dead ends: 1780 [2025-03-04 09:31:14,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=710, Unknown=44, NotChecked=114, Total=992 [2025-03-04 09:31:14,496 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 867 mSDsluCounter, 6908 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 7506 SdHoareTripleChecker+Invalid, 5156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:14,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 7506 Invalid, 5156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5138 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:31:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-03-04 09:31:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1777. [2025-03-04 09:31:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1467 states have (on average 1.650988411724608) internal successors, (2422), 1765 states have internal predecessors, (2422), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2476 transitions. [2025-03-04 09:31:14,511 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2476 transitions. Word has length 97 [2025-03-04 09:31:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:14,511 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2476 transitions. [2025-03-04 09:31:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 23 states have internal predecessors, (155), 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-03-04 09:31:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2476 transitions. [2025-03-04 09:31:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:31:14,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:14,512 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] [2025-03-04 09:31:14,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:31:14,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 09:31:14,713 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:14,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 72364157, now seen corresponding path program 1 times [2025-03-04 09:31:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:14,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650487694] [2025-03-04 09:31:14,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:14,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:31:14,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:31:14,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:14,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650487694] [2025-03-04 09:31:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650487694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225701345] [2025-03-04 09:31:15,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:15,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:15,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:31:15,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:31:15,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:31:15,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:15,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:15,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 09:31:15,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:15,553 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-03-04 09:31:15,615 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:31:15,615 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-03-04 09:31:15,619 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-03-04 09:31:15,635 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-03-04 09:31:15,637 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-03-04 09:31:15,716 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-03-04 09:31:15,719 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-03-04 09:31:15,809 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:15,809 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-03-04 09:31:15,814 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-03-04 09:31:15,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:15,861 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-03-04 09:31:15,867 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-03-04 09:31:15,901 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:15,901 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-03-04 09:31:15,908 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-03-04 09:31:15,917 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-03-04 09:31:15,920 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-03-04 09:31:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:15,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:15,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1646) |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~mem57#1.base| v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1646 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:31:15,964 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_1646 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:31:15,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1645) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1644))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1645) .cse1 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:31:15,989 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_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1644))) (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_1645) .cse1 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1645) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-03-04 09:31:16,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1652))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1644))) (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_1653) .cse0 v_ArrVal_1645) .cse1 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1652))) (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_1653) .cse5 v_ArrVal_1645) (select (select (store .cse6 .cse5 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1646))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-03-04 09:31:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225701345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:16,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:16,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2025-03-04 09:31:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250807662] [2025-03-04 09:31:16,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:16,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 09:31:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:16,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 09:31:16,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=430, Unknown=5, NotChecked=230, Total=756 [2025-03-04 09:31:16,038 INFO L87 Difference]: Start difference. First operand 1777 states and 2476 transitions. Second operand has 21 states, 18 states have (on average 8.555555555555555) internal successors, (154), 21 states have internal predecessors, (154), 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-03-04 09:31:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:18,045 INFO L93 Difference]: Finished difference Result 1779 states and 2480 transitions. [2025-03-04 09:31:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:31:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.555555555555555) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-03-04 09:31:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:18,048 INFO L225 Difference]: With dead ends: 1779 [2025-03-04 09:31:18,049 INFO L226 Difference]: Without dead ends: 1779 [2025-03-04 09:31:18,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=684, Unknown=5, NotChecked=290, Total=1122 [2025-03-04 09:31:18,049 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 874 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 5170 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 5598 SdHoareTripleChecker+Invalid, 5191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:18,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 5598 Invalid, 5191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5170 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:31:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-03-04 09:31:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1755. [2025-03-04 09:31:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1447 states have (on average 1.6579129232895646) internal successors, (2399), 1745 states have internal predecessors, (2399), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:31:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2451 transitions. [2025-03-04 09:31:18,071 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2451 transitions. Word has length 97 [2025-03-04 09:31:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:18,071 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2451 transitions. [2025-03-04 09:31:18,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.555555555555555) internal successors, (154), 21 states have internal predecessors, (154), 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-03-04 09:31:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2451 transitions. [2025-03-04 09:31:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 09:31:18,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:18,073 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-03-04 09:31:18,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 09:31:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:18,274 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1646468566, now seen corresponding path program 1 times [2025-03-04 09:31:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56570532] [2025-03-04 09:31:18,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:18,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:31:18,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:31:18,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:18,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56570532] [2025-03-04 09:31:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56570532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:31:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996182659] [2025-03-04 09:31:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:31:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:18,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:31:18,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:31:18,664 INFO L87 Difference]: Start difference. First operand 1755 states and 2451 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:19,622 INFO L93 Difference]: Finished difference Result 1786 states and 2488 transitions. [2025-03-04 09:31:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:31:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2025-03-04 09:31:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:19,625 INFO L225 Difference]: With dead ends: 1786 [2025-03-04 09:31:19,625 INFO L226 Difference]: Without dead ends: 1786 [2025-03-04 09:31:19,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-04 09:31:19,626 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 914 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:19,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 4090 Invalid, 2832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:31:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2025-03-04 09:31:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1782. [2025-03-04 09:31:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1473 states have (on average 1.648336727766463) internal successors, (2428), 1770 states have internal predecessors, (2428), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2482 transitions. [2025-03-04 09:31:19,640 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2482 transitions. Word has length 99 [2025-03-04 09:31:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2482 transitions. [2025-03-04 09:31:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2482 transitions. [2025-03-04 09:31:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 09:31:19,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:19,641 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-03-04 09:31:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 09:31:19,641 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1646468567, now seen corresponding path program 1 times [2025-03-04 09:31:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70549336] [2025-03-04 09:31:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:31:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:31:19,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:19,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:20,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70549336] [2025-03-04 09:31:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70549336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:20,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:20,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:31:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33341969] [2025-03-04 09:31:20,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:20,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:31:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:20,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:31:20,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:31:20,247 INFO L87 Difference]: Start difference. First operand 1782 states and 2482 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:21,889 INFO L93 Difference]: Finished difference Result 1785 states and 2486 transitions. [2025-03-04 09:31:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:31:21,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2025-03-04 09:31:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:21,892 INFO L225 Difference]: With dead ends: 1785 [2025-03-04 09:31:21,892 INFO L226 Difference]: Without dead ends: 1785 [2025-03-04 09:31:21,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:31:21,893 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 907 mSDsluCounter, 3862 mSDsCounter, 0 mSdLazyCounter, 4357 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 4464 SdHoareTripleChecker+Invalid, 4374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:21,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 4464 Invalid, 4374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4357 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:31:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-03-04 09:31:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1782. [2025-03-04 09:31:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1473 states have (on average 1.646978954514596) internal successors, (2426), 1770 states have internal predecessors, (2426), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2480 transitions. [2025-03-04 09:31:21,907 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2480 transitions. Word has length 99 [2025-03-04 09:31:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:21,908 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2480 transitions. [2025-03-04 09:31:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:31:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2480 transitions. [2025-03-04 09:31:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:31:21,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:21,909 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] [2025-03-04 09:31:21,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 09:31:21,909 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:21,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash -272127525, now seen corresponding path program 1 times [2025-03-04 09:31:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:21,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43520937] [2025-03-04 09:31:21,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:21,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:31:21,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:31:21,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:21,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43520937] [2025-03-04 09:31:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43520937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682481742] [2025-03-04 09:31:22,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:22,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:22,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:22,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:22,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:31:22,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:31:22,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:31:22,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:22,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:22,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 09:31:22,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:22,556 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-03-04 09:31:22,629 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:31:22,629 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-03-04 09:31:22,648 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-03-04 09:31:22,694 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-03-04 09:31:22,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:22,779 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-03-04 09:31:22,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:22,841 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-03-04 09:31:22,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:22,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:31:22,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:22,931 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-03-04 09:31:22,942 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-03-04 09:31:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:22,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:22,975 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:31:22,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:31:22,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (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~mem57#1.base| v_ArrVal_1983))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:23,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (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~mem56#1.base| v_ArrVal_1982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:23,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (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| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682481742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:23,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:23,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-03-04 09:31:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106130412] [2025-03-04 09:31:23,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:23,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:31:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:23,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:31:23,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=638, Unknown=19, NotChecked=280, Total=1056 [2025-03-04 09:31:23,089 INFO L87 Difference]: Start difference. First operand 1782 states and 2480 transitions. Second operand has 26 states, 23 states have (on average 7.0) internal successors, (161), 25 states have internal predecessors, (161), 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-03-04 09:31:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:25,997 INFO L93 Difference]: Finished difference Result 1784 states and 2484 transitions. [2025-03-04 09:31:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:31:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.0) internal successors, (161), 25 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2025-03-04 09:31:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:25,999 INFO L225 Difference]: With dead ends: 1784 [2025-03-04 09:31:25,999 INFO L226 Difference]: Without dead ends: 1784 [2025-03-04 09:31:26,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=790, Unknown=19, NotChecked=310, Total=1260 [2025-03-04 09:31:26,000 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 862 mSDsluCounter, 10330 mSDsCounter, 0 mSdLazyCounter, 7557 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 10927 SdHoareTripleChecker+Invalid, 7575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 7557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:26,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 10927 Invalid, 7575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 7557 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 09:31:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-04 09:31:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1781. [2025-03-04 09:31:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1473 states have (on average 1.645621181262729) internal successors, (2424), 1769 states have internal predecessors, (2424), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2478 transitions. [2025-03-04 09:31:26,014 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2478 transitions. Word has length 100 [2025-03-04 09:31:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:26,014 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2478 transitions. [2025-03-04 09:31:26,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.0) internal successors, (161), 25 states have internal predecessors, (161), 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-03-04 09:31:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2478 transitions. [2025-03-04 09:31:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:31:26,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:26,015 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] [2025-03-04 09:31:26,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:31:26,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:26,215 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:26,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -272127524, now seen corresponding path program 1 times [2025-03-04 09:31:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:26,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717211583] [2025-03-04 09:31:26,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:26,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:31:26,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:31:26,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:26,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:26,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:26,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717211583] [2025-03-04 09:31:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717211583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:26,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615709194] [2025-03-04 09:31:26,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:26,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:26,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:26,790 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:26,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:31:26,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:31:26,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:31:26,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:26,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:26,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 09:31:26,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:26,978 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-03-04 09:31:27,031 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-03-04 09:31:27,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:31:27,036 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-03-04 09:31:27,052 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-03-04 09:31:27,055 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-03-04 09:31:27,103 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-03-04 09:31:27,105 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-03-04 09:31:27,180 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:27,181 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-03-04 09:31:27,184 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-03-04 09:31:27,244 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:27,244 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-03-04 09:31:27,250 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-03-04 09:31:27,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:27,296 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-03-04 09:31:27,302 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-03-04 09:31:27,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:27,341 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-03-04 09:31:27,348 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-03-04 09:31:27,356 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-03-04 09:31:27,360 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-03-04 09:31:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:27,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:27,463 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_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2167 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2025-03-04 09:31:27,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2164) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2165))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2164) .cse1 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:31:27,486 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_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2165))) (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_2164) .cse1 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2164) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2025-03-04 09:31:27,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2162))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2163) .cse0 v_ArrVal_2164) (select (select (store .cse1 .cse0 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2162))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2165))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2163) .cse3 v_ArrVal_2164) .cse4 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-04 09:31:27,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) .cse1 v_ArrVal_2164) .cse2 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2162))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) .cse6 v_ArrVal_2164) (select (select (store .cse7 .cse6 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-03-04 09:31:27,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2172))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2173) .cse0 v_ArrVal_2163) .cse1 v_ArrVal_2164) .cse2 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2172))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2162))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2173) .cse7 v_ArrVal_2163) .cse8 v_ArrVal_2164) (select (select (store .cse9 .cse8 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-03-04 09:31:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615709194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:27,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-04 09:31:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774245954] [2025-03-04 09:31:27,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:27,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:31:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:27,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:31:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=608, Unknown=15, NotChecked=330, Total=1056 [2025-03-04 09:31:27,557 INFO L87 Difference]: Start difference. First operand 1781 states and 2478 transitions. Second operand has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 24 states have internal predecessors, (161), 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-03-04 09:31:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:30,281 INFO L93 Difference]: Finished difference Result 1783 states and 2482 transitions. [2025-03-04 09:31:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:31:30,282 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 24 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2025-03-04 09:31:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:30,283 INFO L225 Difference]: With dead ends: 1783 [2025-03-04 09:31:30,283 INFO L226 Difference]: Without dead ends: 1783 [2025-03-04 09:31:30,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=963, Unknown=16, NotChecked=414, Total=1560 [2025-03-04 09:31:30,284 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 873 mSDsluCounter, 6340 mSDsCounter, 0 mSdLazyCounter, 6714 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 6940 SdHoareTripleChecker+Invalid, 6736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:30,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 6940 Invalid, 6736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 6714 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 09:31:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-03-04 09:31:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1753. [2025-03-04 09:31:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1447 states have (on average 1.6551485832757429) internal successors, (2395), 1743 states have internal predecessors, (2395), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:31:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2447 transitions. [2025-03-04 09:31:30,299 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2447 transitions. Word has length 100 [2025-03-04 09:31:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:30,299 INFO L471 AbstractCegarLoop]: Abstraction has 1753 states and 2447 transitions. [2025-03-04 09:31:30,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 24 states have internal predecessors, (161), 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-03-04 09:31:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2447 transitions. [2025-03-04 09:31:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 09:31:30,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:30,300 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, 1, 1] [2025-03-04 09:31:30,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:31:30,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 09:31:30,501 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1051917264, now seen corresponding path program 1 times [2025-03-04 09:31:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562310659] [2025-03-04 09:31:30,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:30,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 09:31:30,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 09:31:30,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:30,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:30,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562310659] [2025-03-04 09:31:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562310659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:30,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:30,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 09:31:30,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448870014] [2025-03-04 09:31:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:30,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:31:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:30,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:31:30,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:31:30,995 INFO L87 Difference]: Start difference. First operand 1753 states and 2447 transitions. Second operand has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 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-03-04 09:31:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:32,228 INFO L93 Difference]: Finished difference Result 1792 states and 2492 transitions. [2025-03-04 09:31:32,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:31:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 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 103 [2025-03-04 09:31:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:32,230 INFO L225 Difference]: With dead ends: 1792 [2025-03-04 09:31:32,230 INFO L226 Difference]: Without dead ends: 1792 [2025-03-04 09:31:32,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-04 09:31:32,231 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 900 mSDsluCounter, 4599 mSDsCounter, 0 mSdLazyCounter, 3651 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 5196 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:32,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 5196 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3651 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:31:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-03-04 09:31:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1788. [2025-03-04 09:31:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1481 states have (on average 1.6421336934503714) internal successors, (2432), 1776 states have internal predecessors, (2432), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2486 transitions. [2025-03-04 09:31:32,246 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2486 transitions. Word has length 103 [2025-03-04 09:31:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2486 transitions. [2025-03-04 09:31:32,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 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-03-04 09:31:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2486 transitions. [2025-03-04 09:31:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 09:31:32,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:32,247 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, 1, 1] [2025-03-04 09:31:32,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 09:31:32,247 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:32,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1051917265, now seen corresponding path program 1 times [2025-03-04 09:31:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:32,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275426643] [2025-03-04 09:31:32,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:32,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 09:31:32,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 09:31:32,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:32,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:33,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275426643] [2025-03-04 09:31:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275426643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 09:31:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340992217] [2025-03-04 09:31:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:33,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:31:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:33,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:31:33,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:31:33,013 INFO L87 Difference]: Start difference. First operand 1788 states and 2486 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 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-03-04 09:31:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:34,676 INFO L93 Difference]: Finished difference Result 1791 states and 2490 transitions. [2025-03-04 09:31:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:31:34,676 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 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 103 [2025-03-04 09:31:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:34,678 INFO L225 Difference]: With dead ends: 1791 [2025-03-04 09:31:34,678 INFO L226 Difference]: Without dead ends: 1791 [2025-03-04 09:31:34,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-04 09:31:34,679 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 895 mSDsluCounter, 3949 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 4335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:34,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 4547 Invalid, 4335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4311 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:31:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-03-04 09:31:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1788. [2025-03-04 09:31:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1481 states have (on average 1.6407832545577312) internal successors, (2430), 1776 states have internal predecessors, (2430), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2484 transitions. [2025-03-04 09:31:34,695 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2484 transitions. Word has length 103 [2025-03-04 09:31:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:34,696 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2484 transitions. [2025-03-04 09:31:34,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 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-03-04 09:31:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2484 transitions. [2025-03-04 09:31:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:31:34,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:34,696 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, 1, 1, 1] [2025-03-04 09:31:34,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 09:31:34,696 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:34,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:34,697 INFO L85 PathProgramCache]: Analyzing trace with hash 259521877, now seen corresponding path program 1 times [2025-03-04 09:31:34,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:34,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425666987] [2025-03-04 09:31:34,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:34,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:31:34,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:31:34,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:34,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:35,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425666987] [2025-03-04 09:31:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425666987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188332011] [2025-03-04 09:31:35,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:35,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:35,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:35,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:35,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:31:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:31:35,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:31:35,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:35,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:35,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 09:31:35,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:35,483 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-03-04 09:31:35,550 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:31:35,550 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-03-04 09:31:35,575 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-03-04 09:31:35,637 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-03-04 09:31:35,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:35,738 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-03-04 09:31:35,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:35,789 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-03-04 09:31:35,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:35,829 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-03-04 09:31:35,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:35,864 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-03-04 09:31:35,900 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:35,900 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-03-04 09:31:35,909 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-03-04 09:31:35,942 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-04 09:31:35,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-04 09:31:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:35,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:35,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2537) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:31:35,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2537) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:31:35,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (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~mem58#1.base| v_ArrVal_2536))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:36,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:36,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (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~mem57#1.base| v_ArrVal_2535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:36,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2534))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2535)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:36,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2541 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2541))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2534)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2535)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:31:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188332011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:36,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:36,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2025-03-04 09:31:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067443043] [2025-03-04 09:31:36,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:36,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 09:31:36,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:36,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 09:31:36,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=731, Unknown=20, NotChecked=434, Total=1332 [2025-03-04 09:31:36,098 INFO L87 Difference]: Start difference. First operand 1788 states and 2484 transitions. Second operand has 28 states, 25 states have (on average 6.76) internal successors, (169), 27 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:31:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:38,139 INFO L93 Difference]: Finished difference Result 1790 states and 2488 transitions. [2025-03-04 09:31:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:31:38,139 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.76) internal successors, (169), 27 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-03-04 09:31:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:38,141 INFO L225 Difference]: With dead ends: 1790 [2025-03-04 09:31:38,141 INFO L226 Difference]: Without dead ends: 1790 [2025-03-04 09:31:38,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=894, Unknown=20, NotChecked=476, Total=1560 [2025-03-04 09:31:38,142 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 855 mSDsluCounter, 7461 mSDsCounter, 0 mSdLazyCounter, 5616 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 8057 SdHoareTripleChecker+Invalid, 5635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:38,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 8057 Invalid, 5635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5616 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:31:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2025-03-04 09:31:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1787. [2025-03-04 09:31:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1481 states have (on average 1.6394328156650912) internal successors, (2428), 1775 states have internal predecessors, (2428), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2482 transitions. [2025-03-04 09:31:38,160 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2482 transitions. Word has length 104 [2025-03-04 09:31:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:38,160 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2482 transitions. [2025-03-04 09:31:38,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.76) internal successors, (169), 27 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:31:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2482 transitions. [2025-03-04 09:31:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:31:38,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:38,161 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, 1, 1, 1] [2025-03-04 09:31:38,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:31:38,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:38,362 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:38,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 259521878, now seen corresponding path program 1 times [2025-03-04 09:31:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:38,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66032444] [2025-03-04 09:31:38,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:38,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:31:38,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:31:38,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:38,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:39,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66032444] [2025-03-04 09:31:39,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66032444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:39,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592227079] [2025-03-04 09:31:39,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:39,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:39,178 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:39,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:31:39,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:31:39,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:31:39,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:39,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:39,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 09:31:39,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:39,385 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-03-04 09:31:39,446 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-03-04 09:31:39,455 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:31:39,455 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-03-04 09:31:39,483 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-03-04 09:31:39,487 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-03-04 09:31:39,554 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 33 treesize of output 15 [2025-03-04 09:31:39,557 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-03-04 09:31:39,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:39,674 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 73 treesize of output 66 [2025-03-04 09:31:39,680 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-03-04 09:31:39,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:39,751 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 73 treesize of output 66 [2025-03-04 09:31:39,756 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-03-04 09:31:39,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:39,807 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 73 treesize of output 66 [2025-03-04 09:31:39,812 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-03-04 09:31:39,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:39,866 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 73 treesize of output 66 [2025-03-04 09:31:39,869 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-03-04 09:31:39,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:39,922 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 73 treesize of output 66 [2025-03-04 09:31:39,925 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-03-04 09:31:39,942 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 42 treesize of output 18 [2025-03-04 09:31:39,946 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-03-04 09:31:39,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:31:39,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 09:31:39,987 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:31:39,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:31:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:40,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:40,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2736))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2735) .cse1 v_ArrVal_2738) (select (select (store .cse2 .cse1 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2740))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2741 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2736))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2737))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2735) .cse4 v_ArrVal_2738) .cse5 v_ArrVal_2740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2741) (select (select (store .cse6 .cse5 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-03-04 09:31:40,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2734))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2736))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2733) .cse0 v_ArrVal_2735) .cse1 v_ArrVal_2738) (select (select (store .cse2 .cse1 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2740))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2741 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2734))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2736))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2737))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2733) .cse5 v_ArrVal_2735) .cse6 v_ArrVal_2738) .cse7 v_ArrVal_2740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2741) (select (select (store .cse8 .cse7 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2025-03-04 09:31:40,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2734))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2736))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2733) .cse1 v_ArrVal_2735) .cse2 v_ArrVal_2738) (select (select (store .cse3 .cse2 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2740))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2741 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2734))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2736))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2737))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2733) .cse6 v_ArrVal_2735) .cse7 v_ArrVal_2738) .cse8 v_ArrVal_2740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2741) (select (select (store .cse9 .cse8 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2025-03-04 09:31:40,687 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2747))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2734))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2736))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2746) .cse0 v_ArrVal_2733) .cse1 v_ArrVal_2735) .cse2 v_ArrVal_2738) (select (select (store .cse3 .cse2 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2740))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2747 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2741 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2747))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2734))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2736))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2737))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2746) .cse7 v_ArrVal_2733) .cse8 v_ArrVal_2735) .cse9 v_ArrVal_2738) .cse10 v_ArrVal_2740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2741) (select (select (store .cse11 .cse10 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2025-03-04 09:31:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592227079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:40,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:31:40,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-04 09:31:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17899902] [2025-03-04 09:31:40,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:31:40,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 09:31:40,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:40,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 09:31:40,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1227, Unknown=35, NotChecked=300, Total=1722 [2025-03-04 09:31:40,692 INFO L87 Difference]: Start difference. First operand 1787 states and 2482 transitions. Second operand has 30 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 29 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:31:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:44,800 INFO L93 Difference]: Finished difference Result 1789 states and 2486 transitions. [2025-03-04 09:31:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:31:44,801 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 29 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-03-04 09:31:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:44,802 INFO L225 Difference]: With dead ends: 1789 [2025-03-04 09:31:44,802 INFO L226 Difference]: Without dead ends: 1789 [2025-03-04 09:31:44,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=1965, Unknown=35, NotChecked=380, Total=2652 [2025-03-04 09:31:44,803 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 865 mSDsluCounter, 8917 mSDsCounter, 0 mSdLazyCounter, 9733 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 9513 SdHoareTripleChecker+Invalid, 9762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 9733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:44,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 9513 Invalid, 9762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 9733 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-04 09:31:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2025-03-04 09:31:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1751. [2025-03-04 09:31:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1447 states have (on average 1.6523842432619211) internal successors, (2391), 1741 states have internal predecessors, (2391), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 09:31:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2443 transitions. [2025-03-04 09:31:44,821 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2443 transitions. Word has length 104 [2025-03-04 09:31:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:44,821 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2443 transitions. [2025-03-04 09:31:44,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 29 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:31:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2443 transitions. [2025-03-04 09:31:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 09:31:44,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:44,822 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, 1, 1, 1, 1, 1] [2025-03-04 09:31:44,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 09:31:45,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 09:31:45,023 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1586688984, now seen corresponding path program 1 times [2025-03-04 09:31:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799323406] [2025-03-04 09:31:45,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:45,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 09:31:45,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 09:31:45,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:45,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799323406] [2025-03-04 09:31:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799323406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 09:31:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475956866] [2025-03-04 09:31:45,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:31:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:45,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:31:45,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:31:45,395 INFO L87 Difference]: Start difference. First operand 1751 states and 2443 transitions. Second operand has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 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-03-04 09:31:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:46,734 INFO L93 Difference]: Finished difference Result 1796 states and 2494 transitions. [2025-03-04 09:31:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:31:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 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 106 [2025-03-04 09:31:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:46,736 INFO L225 Difference]: With dead ends: 1796 [2025-03-04 09:31:46,736 INFO L226 Difference]: Without dead ends: 1796 [2025-03-04 09:31:46,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-04 09:31:46,736 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 903 mSDsluCounter, 5231 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:46,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 5830 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3967 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:31:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-03-04 09:31:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1792. [2025-03-04 09:31:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1487 states have (on average 1.636852723604573) internal successors, (2434), 1780 states have internal predecessors, (2434), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2488 transitions. [2025-03-04 09:31:46,748 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2488 transitions. Word has length 106 [2025-03-04 09:31:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:46,748 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2488 transitions. [2025-03-04 09:31:46,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 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-03-04 09:31:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2488 transitions. [2025-03-04 09:31:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 09:31:46,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:46,749 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, 1, 1, 1, 1, 1] [2025-03-04 09:31:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 09:31:46,749 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1586688985, now seen corresponding path program 1 times [2025-03-04 09:31:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916469717] [2025-03-04 09:31:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:46,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 09:31:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 09:31:46,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:46,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916469717] [2025-03-04 09:31:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916469717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 09:31:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694207624] [2025-03-04 09:31:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:31:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:47,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:31:47,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:31:47,920 INFO L87 Difference]: Start difference. First operand 1792 states and 2488 transitions. Second operand has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 09:31:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:49,136 INFO L93 Difference]: Finished difference Result 1795 states and 2492 transitions. [2025-03-04 09:31:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:31:49,136 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 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 106 [2025-03-04 09:31:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:49,138 INFO L225 Difference]: With dead ends: 1795 [2025-03-04 09:31:49,138 INFO L226 Difference]: Without dead ends: 1795 [2025-03-04 09:31:49,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2025-03-04 09:31:49,138 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 911 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:49,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 3138 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:31:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-03-04 09:31:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1792. [2025-03-04 09:31:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1487 states have (on average 1.6355077336919972) internal successors, (2432), 1780 states have internal predecessors, (2432), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2486 transitions. [2025-03-04 09:31:49,154 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2486 transitions. Word has length 106 [2025-03-04 09:31:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:49,154 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2486 transitions. [2025-03-04 09:31:49,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 09:31:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2486 transitions. [2025-03-04 09:31:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 09:31:49,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:49,155 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, 1, 1, 1, 1, 1, 1] [2025-03-04 09:31:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 09:31:49,155 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:49,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash 475973683, now seen corresponding path program 1 times [2025-03-04 09:31:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334897091] [2025-03-04 09:31:49,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:49,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 09:31:49,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 09:31:49,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:31:49,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:49,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334897091] [2025-03-04 09:31:49,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334897091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:49,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:49,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:31:49,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454592839] [2025-03-04 09:31:49,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:49,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:31:49,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:31:49,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:31:49,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:31:49,488 INFO L87 Difference]: Start difference. First operand 1792 states and 2486 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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-03-04 09:31:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:50,202 INFO L93 Difference]: Finished difference Result 1791 states and 2484 transitions. [2025-03-04 09:31:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:31:50,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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 107 [2025-03-04 09:31:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:50,204 INFO L225 Difference]: With dead ends: 1791 [2025-03-04 09:31:50,204 INFO L226 Difference]: Without dead ends: 1791 [2025-03-04 09:31:50,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:31:50,204 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 2 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3549 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:50,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3549 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:31:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-03-04 09:31:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2025-03-04 09:31:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1487 states have (on average 1.6341627437794217) internal successors, (2430), 1779 states have internal predecessors, (2430), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-04 09:31:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2484 transitions. [2025-03-04 09:31:50,214 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2484 transitions. Word has length 107 [2025-03-04 09:31:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:50,215 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2484 transitions. [2025-03-04 09:31:50,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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-03-04 09:31:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2484 transitions. [2025-03-04 09:31:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 09:31:50,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:50,215 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, 1, 1, 1, 1, 1, 1] [2025-03-04 09:31:50,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 09:31:50,215 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:31:50,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash 475973684, now seen corresponding path program 1 times [2025-03-04 09:31:50,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:31:50,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117298909] [2025-03-04 09:31:50,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:31:50,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 09:31:50,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 09:31:50,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:50,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:31:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117298909] [2025-03-04 09:31:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117298909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:31:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042167508] [2025-03-04 09:31:51,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:51,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:51,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:31:51,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 09:31:51,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 09:31:51,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 09:31:51,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:51,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:51,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 09:31:51,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:51,346 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-03-04 09:31:51,421 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:31:51,421 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-03-04 09:31:51,429 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-03-04 09:31:51,453 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-03-04 09:31:51,459 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-03-04 09:31:51,556 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 33 treesize of output 15 [2025-03-04 09:31:51,560 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-03-04 09:31:51,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:51,689 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 73 treesize of output 66 [2025-03-04 09:31:51,692 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-03-04 09:31:51,784 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:51,785 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 73 treesize of output 66 [2025-03-04 09:31:51,794 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-03-04 09:31:51,855 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:51,855 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 73 treesize of output 66 [2025-03-04 09:31:51,862 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-03-04 09:31:51,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:51,923 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 73 treesize of output 66 [2025-03-04 09:31:51,926 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-03-04 09:31:51,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:51,988 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 73 treesize of output 66 [2025-03-04 09:31:51,991 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-03-04 09:31:52,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:31:52,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 09:31:52,066 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-03-04 09:31:52,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-03-04 09:31:52,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:31:52,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:31:52,096 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-03-04 09:31:52,105 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-03-04 09:31:52,107 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-03-04 09:31:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:52,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:31:52,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3243 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3243) |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~mem60#1.base| v_ArrVal_3242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:31:53,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3240 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3236 (Array Int Int)) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int)) (v_ArrVal_3239 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3235))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3238))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3236) .cse0 v_ArrVal_3237) .cse1 v_ArrVal_3239) (select (select (store .cse2 .cse1 v_ArrVal_3240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3243))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3236 (Array Int Int)) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int)) (v_ArrVal_3239 (Array Int Int))) (or (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3241 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3235))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3238))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3240))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3236) .cse5 v_ArrVal_3237) .cse6 v_ArrVal_3239) .cse7 v_ArrVal_3243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3241) (select (select (store .cse8 .cse7 v_ArrVal_3242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false