./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/loop-industry-pattern/aiob_4.c.v+lh-reducer.c -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 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:14:04,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:14:04,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:14:04,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:14:04,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:14:04,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:14:04,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:14:04,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:14:04,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:14:04,138 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:14:04,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:14:04,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:14:04,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:14:04,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:14:04,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:14:04,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:14:04,140 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:04,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:14:04,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:14:04,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:14:04,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:14:04,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:14:04,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:14:04,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:14:04,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:14:04,141 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 -> 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 [2025-03-08 23:14:04,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:14:04,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:14:04,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:14:04,353 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:14:04,353 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:14:04,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c [2025-03-08 23:14:05,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e30f4a0/bd6a99af50ce4df7a485f15d53ab810d/FLAG960943f25 [2025-03-08 23:14:05,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:14:05,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c [2025-03-08 23:14:05,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e30f4a0/bd6a99af50ce4df7a485f15d53ab810d/FLAG960943f25 [2025-03-08 23:14:06,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e30f4a0/bd6a99af50ce4df7a485f15d53ab810d [2025-03-08 23:14:06,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:14:06,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:14:06,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:06,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:14:06,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:14:06,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ebfd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06, skipping insertion in model container [2025-03-08 23:14:06,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:14:06,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:06,237 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:14:06,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:06,303 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:14:06,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06 WrapperNode [2025-03-08 23:14:06,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:06,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:06,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:14:06,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:14:06,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,346 INFO L138 Inliner]: procedures = 18, calls = 203, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 418 [2025-03-08 23:14:06,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:06,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:14:06,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:14:06,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:14:06,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,384 INFO L175 MemorySlicer]: Split 180 memory accesses to 5 slices as follows [2, 7, 128, 2, 41]. 71 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 7, 0, 2, 0]. The 127 writes are split as follows [0, 0, 127, 0, 0]. [2025-03-08 23:14:06,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:14:06,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:14:06,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:14:06,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:14:06,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (1/1) ... [2025-03-08 23:14:06,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:06,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:14:06,441 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-08 23:14:06,447 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-08 23:14:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:14:06,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 23:14:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:14:06,571 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:14:06,572 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:14:12,743 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L173: call ULTIMATE.dealloc(main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset);havoc main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset;havoc main_~__tmp_1~0#1.base, main_~__tmp_1~0#1.offset, main_~Id_MCDC_89__Id_MCDC_88~0#1.base, main_~Id_MCDC_89__Id_MCDC_88~0#1.offset, main_~Id_MCDC_89__Id_MCDC_94~0#1.base, main_~Id_MCDC_89__Id_MCDC_94~0#1.offset, main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset, main_~Id_MCDC_89__Id_MCDC_96~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset);havoc main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset; [2025-03-08 23:14:12,744 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__Id_MCDC_92~1#1; [2025-03-08 23:14:12,744 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc main_~Id_MCDC_89____CPAchecker_TMP_2~0#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__Id_MCDC_92~0#1; [2025-03-08 23:14:12,776 INFO L? ?]: Removed 234 outVars from TransFormulas that were not future-live. [2025-03-08 23:14:12,776 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:14:12,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:14:12,788 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:14:12,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:12 BoogieIcfgContainer [2025-03-08 23:14:12,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:14:12,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:14:12,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:14:12,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:14:12,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:14:06" (1/3) ... [2025-03-08 23:14:12,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294fb551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:12, skipping insertion in model container [2025-03-08 23:14:12,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:06" (2/3) ... [2025-03-08 23:14:12,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294fb551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:12, skipping insertion in model container [2025-03-08 23:14:12,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:12" (3/3) ... [2025-03-08 23:14:12,797 INFO L128 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lh-reducer.c [2025-03-08 23:14:12,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:14:12,807 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aiob_4.c.v+lh-reducer.c that has 1 procedures, 183 locations, 1 initial locations, 0 loop locations, and 86 error locations. [2025-03-08 23:14:12,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:14:12,852 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;@1da9091f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:14:12,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-03-08 23:14:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 182 states have internal predecessors, (188), 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-08 23:14:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:14:12,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:12,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:14:12,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:14:12,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash 7073085, now seen corresponding path program 1 times [2025-03-08 23:14:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809857086] [2025-03-08 23:14:12,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:12,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:14:12,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:14:12,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:12,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:13,195 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-08 23:14:13,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809857086] [2025-03-08 23:14:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809857086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:13,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:13,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448856643] [2025-03-08 23:14:13,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:13,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:14:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:13,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:14:13,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:14:13,219 INFO L87 Difference]: Start difference. First operand has 183 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 182 states have internal predecessors, (188), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:18,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:14:22,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:14:27,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:14:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:27,629 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2025-03-08 23:14:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:14:27,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 23:14:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:27,635 INFO L225 Difference]: With dead ends: 183 [2025-03-08 23:14:27,635 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 23:14:27,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:14:27,637 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 164 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:27,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 200 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2025-03-08 23:14:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 23:14:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-08 23:14:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 94 states have (on average 1.9361702127659575) internal successors, (182), 179 states have internal predecessors, (182), 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-08 23:14:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2025-03-08 23:14:27,660 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 4 [2025-03-08 23:14:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:27,660 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2025-03-08 23:14:27,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2025-03-08 23:14:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:14:27,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:27,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:14:27,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:14:27,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:14:27,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash 7079262, now seen corresponding path program 1 times [2025-03-08 23:14:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911506800] [2025-03-08 23:14:27,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:27,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:14:27,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:14:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:28,084 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-08 23:14:28,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:28,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911506800] [2025-03-08 23:14:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911506800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:28,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:28,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:28,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360658146] [2025-03-08 23:14:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:28,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:14:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:14:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:14:28,087 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:33,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:14:37,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:14:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,465 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2025-03-08 23:14:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:14:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 23:14:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,466 INFO L225 Difference]: With dead ends: 139 [2025-03-08 23:14:38,466 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 23:14:38,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:14:38,467 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 214 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 61 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2025-03-08 23:14:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 23:14:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-08 23:14:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.5) internal successors, (141), 138 states have internal predecessors, (141), 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-08 23:14:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2025-03-08 23:14:38,475 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 4 [2025-03-08 23:14:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,475 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2025-03-08 23:14:38,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2025-03-08 23:14:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 23:14:38,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 23:14:38,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:14:38,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:14:38,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 7079263, now seen corresponding path program 1 times [2025-03-08 23:14:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891537674] [2025-03-08 23:14:38,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 23:14:38,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 23:14:38,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,965 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-08 23:14:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891537674] [2025-03-08 23:14:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891537674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225663514] [2025-03-08 23:14:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:14:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:14:38,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:14:38,967 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:44,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:14:48,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:14:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:48,843 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2025-03-08 23:14:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:14:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 23:14:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:48,844 INFO L225 Difference]: With dead ends: 98 [2025-03-08 23:14:48,844 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 23:14:48,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:14:48,845 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:48,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 121 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2025-03-08 23:14:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 23:14:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 23:14:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 97 states have internal predecessors, (100), 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-08 23:14:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2025-03-08 23:14:48,849 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 4 [2025-03-08 23:14:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:48,849 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-03-08 23:14:48,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2025-03-08 23:14:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 23:14:48,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:48,851 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-08 23:14:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:14:48,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:14:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1278941367, now seen corresponding path program 1 times [2025-03-08 23:14:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472130588] [2025-03-08 23:14:48,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:52,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 23:14:52,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 23:14:52,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:52,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:54,302 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-08 23:14:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472130588] [2025-03-08 23:14:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472130588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:54,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:54,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:14:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295679327] [2025-03-08 23:14:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:54,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:14:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:54,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:14:54,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:14:54,304 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-08 23:14:59,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:15:04,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:15:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:05,173 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2025-03-08 23:15:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:15:05,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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 90 [2025-03-08 23:15:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:05,174 INFO L225 Difference]: With dead ends: 98 [2025-03-08 23:15:05,174 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 23:15:05,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:15:05,175 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:05,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 229 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2025-03-08 23:15:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 23:15:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 23:15:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 94 states have (on average 1.053191489361702) internal successors, (99), 96 states have internal predecessors, (99), 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-08 23:15:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2025-03-08 23:15:05,182 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 90 [2025-03-08 23:15:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:05,182 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2025-03-08 23:15:05,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 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-08 23:15:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2025-03-08 23:15:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 23:15:05,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:05,184 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-08 23:15:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:15:05,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:15:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1278941366, now seen corresponding path program 1 times [2025-03-08 23:15:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554330536] [2025-03-08 23:15:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:09,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 23:15:09,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 23:15:09,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:09,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:09,508 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-08 23:15:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554330536] [2025-03-08 23:15:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554330536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:09,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:15:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774072557] [2025-03-08 23:15:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:15:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:09,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:15:09,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:15:09,510 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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-08 23:15:14,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:15:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:15,173 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2025-03-08 23:15:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:15:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2025-03-08 23:15:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:15,175 INFO L225 Difference]: With dead ends: 96 [2025-03-08 23:15:15,175 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 23:15:15,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:15:15,176 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:15,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2025-03-08 23:15:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 23:15:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 23:15:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 95 states have internal predecessors, (98), 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-08 23:15:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2025-03-08 23:15:15,180 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 90 [2025-03-08 23:15:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:15,180 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2025-03-08 23:15:15,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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-08 23:15:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2025-03-08 23:15:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 23:15:15,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:15,181 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-08 23:15:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:15:15,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:15:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1278941073, now seen corresponding path program 1 times [2025-03-08 23:15:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598528811] [2025-03-08 23:15:15,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:18,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 23:15:18,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 23:15:18,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:18,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:19,079 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-08 23:15:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598528811] [2025-03-08 23:15:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598528811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:19,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:15:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694064074] [2025-03-08 23:15:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:19,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:15:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:19,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:15:19,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:15:19,080 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-08 23:15:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:19,119 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2025-03-08 23:15:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:15:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2025-03-08 23:15:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:19,120 INFO L225 Difference]: With dead ends: 96 [2025-03-08 23:15:19,120 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 23:15:19,120 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-08 23:15:19,121 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:19,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:15:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 23:15:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 23:15:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 95 states have internal predecessors, (97), 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-08 23:15:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2025-03-08 23:15:19,123 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 90 [2025-03-08 23:15:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:19,126 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2025-03-08 23:15:19,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-08 23:15:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2025-03-08 23:15:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 23:15:19,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:19,127 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-08 23:15:19,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:15:19,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:15:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1278950272, now seen corresponding path program 1 times [2025-03-08 23:15:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:19,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571679986] [2025-03-08 23:15:19,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:22,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 23:15:22,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 23:15:22,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:22,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:23,171 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-08 23:15:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571679986] [2025-03-08 23:15:23,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571679986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:23,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:23,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:15:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829802519] [2025-03-08 23:15:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:23,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:15:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:23,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:15:23,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:15:23,172 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-08 23:15:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:23,371 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2025-03-08 23:15:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:15:23,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2025-03-08 23:15:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:23,372 INFO L225 Difference]: With dead ends: 105 [2025-03-08 23:15:23,372 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 23:15:23,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:15:23,374 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 97 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:23,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 194 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:15:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 23:15:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2025-03-08 23:15:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 98 states have internal predecessors, (100), 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-08 23:15:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2025-03-08 23:15:23,377 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 90 [2025-03-08 23:15:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:23,377 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2025-03-08 23:15:23,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-08 23:15:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2025-03-08 23:15:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 23:15:23,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:23,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:15:23,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:15:23,378 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:15:23,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash 702005513, now seen corresponding path program 1 times [2025-03-08 23:15:23,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:23,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181953938] [2025-03-08 23:15:23,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:15:26,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 23:15:26,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 23:15:26,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:15:26,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:15:32,752 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-08 23:15:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:15:32,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181953938] [2025-03-08 23:15:32,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181953938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:15:32,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:15:32,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:15:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724687861] [2025-03-08 23:15:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:15:32,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:15:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:15:32,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:15:32,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:15:32,755 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-08 23:15:36,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:15:41,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 23:15:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:15:42,313 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2025-03-08 23:15:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:15:42,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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 92 [2025-03-08 23:15:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:15:42,314 INFO L225 Difference]: With dead ends: 103 [2025-03-08 23:15:42,314 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 23:15:42,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:15:42,314 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:15:42,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 450 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-03-08 23:15:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 23:15:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-08 23:15:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.03) internal successors, (103), 101 states have internal predecessors, (103), 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-08 23:15:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2025-03-08 23:15:42,323 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 92 [2025-03-08 23:15:42,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:15:42,323 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2025-03-08 23:15:42,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-08 23:15:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2025-03-08 23:15:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 23:15:42,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:15:42,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:15:42,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:15:42,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-03-08 23:15:42,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:15:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash 82296742, now seen corresponding path program 1 times [2025-03-08 23:15:42,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:15:42,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506610070] [2025-03-08 23:15:42,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:15:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms