./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:46:21,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:46:21,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:46:21,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:46:21,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:46:21,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:46:21,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:46:21,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:46:21,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:46:21,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:46:21,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:46:21,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:46:21,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:46:21,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:46:21,277 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:46:21,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:46:21,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:46:21,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:46:21,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:46:21,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:46:21,279 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:46:21,279 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:46:21,279 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:46:21,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:46:21,280 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:46:21,280 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:46:21,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:46:21,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:46:21,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:46:21,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:46:21,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:46:21,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:46:21,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:46:21,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 [2025-02-08 06:46:21,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:46:21,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:46:21,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:46:21,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:46:21,536 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:46:21,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2025-02-08 06:46:22,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4ced514e/c38c77befbf248939d5bb6d4a27dcc0e/FLAG11a17c20a [2025-02-08 06:46:22,985 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:46:22,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2025-02-08 06:46:22,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4ced514e/c38c77befbf248939d5bb6d4a27dcc0e/FLAG11a17c20a [2025-02-08 06:46:23,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4ced514e/c38c77befbf248939d5bb6d4a27dcc0e [2025-02-08 06:46:23,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:46:23,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:46:23,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:46:23,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:46:23,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:46:23,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23, skipping insertion in model container [2025-02-08 06:46:23,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:46:23,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:46:23,232 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:46:23,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:46:23,317 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:46:23,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23 WrapperNode [2025-02-08 06:46:23,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:46:23,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:46:23,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:46:23,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:46:23,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,381 INFO L138 Inliner]: procedures = 18, calls = 293, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 835 [2025-02-08 06:46:23,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:46:23,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:46:23,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:46:23,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:46:23,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,440 INFO L175 MemorySlicer]: Split 189 memory accesses to 5 slices as follows [2, 7, 137, 2, 41]. 72 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-02-08 06:46:23,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,467 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:46:23,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:46:23,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:46:23,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:46:23,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (1/1) ... [2025-02-08 06:46:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:46:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:23,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:46:23,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 06:46:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:46:23,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 06:46:23,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:46:23,662 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:46:23,664 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:46:29,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-08 06:46:29,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: havoc main_~Id_MCDC_89____CPAchecker_TMP_2~9#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__Id_MCDC_92~9#1; [2025-02-08 06:46:29,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~Id_MCDC_89____CPAchecker_TMP_2~8#1, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~9#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__Id_MCDC_92~8#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~7#1, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~8#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__Id_MCDC_92~7#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~6#1, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~7#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__Id_MCDC_92~6#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~5#1, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~6#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__Id_MCDC_92~5#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~4#1, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~5#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__Id_MCDC_92~4#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~3#1, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~4#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__Id_MCDC_92~3#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~2#1, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~3#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__Id_MCDC_92~2#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~1#1, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~2#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__Id_MCDC_92~1#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~1#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__Id_MCDC_92~0#1;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-02-08 06:46:29,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L460: havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__Id_MCDC_92~10#1; [2025-02-08 06:46:29,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume #valid == main_old_#valid#1;assume #valid == main_old_#valid#1;#t~ret56#1 := main_#res#1;havoc main_#t~nondet4#1.base, main_#t~nondet4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1, main_#t~mem47#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem55#1, main_~Id_MCDC_89____CPAchecker_TMP_2~9#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__Id_MCDC_92~9#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__Id_MCDC_92~10#1, main_~Id_MCDC_89____CPAchecker_TMP_2~8#1, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~9#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__Id_MCDC_92~8#1, main_~Id_MCDC_89____CPAchecker_TMP_2~7#1, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~8#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__Id_MCDC_92~7#1, main_~Id_MCDC_89____CPAchecker_TMP_2~6#1, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~7#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__Id_MCDC_92~6#1, main_~Id_MCDC_89____CPAchecker_TMP_2~5#1, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~6#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__Id_MCDC_92~5#1, main_~Id_MCDC_89____CPAchecker_TMP_2~4#1, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~5#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__Id_MCDC_92~4#1, main_~Id_MCDC_89____CPAchecker_TMP_2~3#1, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~4#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__Id_MCDC_92~3#1, main_~Id_MCDC_89____CPAchecker_TMP_2~2#1, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~3#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__Id_MCDC_92~2#1, main_~Id_MCDC_89____CPAchecker_TMP_2~1#1, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~2#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__Id_MCDC_92~1#1, main_~Id_MCDC_89____CPAchecker_TMP_2~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~1#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__Id_MCDC_92~0#1, 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, main_~main__Id_MCDC_97~0#1.base, main_~main__Id_MCDC_97~0#1.offset, main_~main__Id_MCDC_98~0#1.base, main_~main__Id_MCDC_98~0#1.offset, main_~main__Id_MCDC_99~0#1.base, main_~main__Id_MCDC_99~0#1.offset, main_~main__Id_MCDC_100~0#1.base, main_~main__Id_MCDC_100~0#1.offset, main_~main__Id_MCDC_101~0#1.base, main_~main__Id_MCDC_101~0#1.offset, main_~main__Id_MCDC_102~0#1.base, main_~main__Id_MCDC_102~0#1.offset, main_~main__Id_MCDC_103~0#1, main_~main__Id_MCDC_104~0#1, main_~main__Id_MCDC_105~0#1, main_~main__Id_MCDC_106~0#1, main_~main__Id_MCDC_107~0#1, main_~main__Id_MCDC_108~0#1, main_~main__Id_MCDC_109~0#1, main_~main__Id_MCDC_110~0#1, main_~main__Id_MCDC_111~0#1, main_~main__Id_MCDC_112~0#1.base, main_~main__Id_MCDC_112~0#1.offset, main_~main__Id_MCDC_113~0#1, main_~main__Id_MCDC_114~0#1, main_~main__Id_MCDC_115~0#1, main_~main__Id_MCDC_116~0#1, main_~main__Id_MCDC_117~0#1, main_~main__Id_MCDC_118~0#1, main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_38.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_38.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_39.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_39.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_40.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_40.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_41.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_41.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_42.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_42.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_43.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_43.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_44.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_44.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_45.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_45.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_46.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_46.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_29.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_29.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_30.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_30.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_31.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_31.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_32.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_32.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_33.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_33.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_34.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_34.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_35.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_35.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_36.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_36.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_37.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_37.offset;assume { :end_inline_main } true; [2025-02-08 06:46:29,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume !(#valid == main_old_#valid#1); [2025-02-08 06:46:30,043 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-02-08 06:46:30,043 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:46:30,056 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:46:30,057 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:46:30,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:30 BoogieIcfgContainer [2025-02-08 06:46:30,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:46:30,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:46:30,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:46:30,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:46:30,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:46:23" (1/3) ... [2025-02-08 06:46:30,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712a6ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:46:30, skipping insertion in model container [2025-02-08 06:46:30,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:23" (2/3) ... [2025-02-08 06:46:30,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712a6ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:46:30, skipping insertion in model container [2025-02-08 06:46:30,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:30" (3/3) ... [2025-02-08 06:46:30,065 INFO L128 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lhb-reducer.c [2025-02-08 06:46:30,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:46:30,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aiob_4.c.v+lhb-reducer.c that has 1 procedures, 242 locations, 1 initial locations, 0 loop locations, and 104 error locations. [2025-02-08 06:46:30,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:46:30,118 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;@6678aec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:46:30,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-02-08 06:46:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 136 states have (on average 2.0661764705882355) internal successors, (281), 240 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:46:30,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:30,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:46:30,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:46:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 395149, now seen corresponding path program 1 times [2025-02-08 06:46:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473517079] [2025-02-08 06:46:30,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:30,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:46:30,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:46:30,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:30,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:30,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:30,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473517079] [2025-02-08 06:46:30,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473517079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:30,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:30,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:46:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402523350] [2025-02-08 06:46:30,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:30,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:46:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:30,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:46:30,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:30,813 INFO L87 Difference]: Start difference. First operand has 241 states, 136 states have (on average 2.0661764705882355) internal successors, (281), 240 states have internal predecessors, (281), 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.0) 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-02-08 06:46:35,963 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-02-08 06:46:40,243 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-02-08 06:46:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:41,853 INFO L93 Difference]: Finished difference Result 200 states and 229 transitions. [2025-02-08 06:46:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:46:41,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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-02-08 06:46:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:41,861 INFO L225 Difference]: With dead ends: 200 [2025-02-08 06:46:41,861 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 06:46:41,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:46:41,864 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 276 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:41,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 147 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 259 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2025-02-08 06:46:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 06:46:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-08 06:46:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.451851851851852) internal successors, (196), 196 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 196 transitions. [2025-02-08 06:46:41,905 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 196 transitions. Word has length 3 [2025-02-08 06:46:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:41,905 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 196 transitions. [2025-02-08 06:46:41,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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-02-08 06:46:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 196 transitions. [2025-02-08 06:46:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:46:41,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:41,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:46:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:46:41,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:46:41,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash 395150, now seen corresponding path program 1 times [2025-02-08 06:46:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316431795] [2025-02-08 06:46:41,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:42,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:46:42,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:46:42,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:42,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316431795] [2025-02-08 06:46:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316431795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:42,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:46:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353465038] [2025-02-08 06:46:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:46:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:42,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:46:42,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:42,482 INFO L87 Difference]: Start difference. First operand 197 states and 196 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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-02-08 06:46:47,428 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-02-08 06:46:51,713 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-02-08 06:46:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:52,535 INFO L93 Difference]: Finished difference Result 156 states and 155 transitions. [2025-02-08 06:46:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:46:52,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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-02-08 06:46:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:52,537 INFO L225 Difference]: With dead ends: 156 [2025-02-08 06:46:52,537 INFO L226 Difference]: Without dead ends: 156 [2025-02-08 06:46:52,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 06:46:52,538 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 80 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:52,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 257 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2025-02-08 06:46:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-08 06:46:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-08 06:46:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 155 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 155 transitions. [2025-02-08 06:46:52,544 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 155 transitions. Word has length 3 [2025-02-08 06:46:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:52,545 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 155 transitions. [2025-02-08 06:46:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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-02-08 06:46:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 155 transitions. [2025-02-08 06:46:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 06:46:52,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:52,546 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] [2025-02-08 06:46:52,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:46:52,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:46:52,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1699167600, now seen corresponding path program 1 times [2025-02-08 06:46:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:52,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473289751] [2025-02-08 06:46:52,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:52,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:56,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 06:46:56,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 06:46:56,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:56,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473289751] [2025-02-08 06:46:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473289751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:46:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407366076] [2025-02-08 06:46:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:57,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:46:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:57,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:46:57,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:46:57,617 INFO L87 Difference]: Start difference. First operand 156 states and 155 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:03,080 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-02-08 06:47:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:47:04,675 INFO L93 Difference]: Finished difference Result 155 states and 154 transitions. [2025-02-08 06:47:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:47:04,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-08 06:47:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:47:04,677 INFO L225 Difference]: With dead ends: 155 [2025-02-08 06:47:04,677 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 06:47:04,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:47:04,678 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 102 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:47:04,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 301 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-02-08 06:47:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 06:47:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-08 06:47:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 154 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 154 transitions. [2025-02-08 06:47:04,684 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 154 transitions. Word has length 88 [2025-02-08 06:47:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:47:04,685 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 154 transitions. [2025-02-08 06:47:04,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 154 transitions. [2025-02-08 06:47:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 06:47:04,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:47:04,686 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] [2025-02-08 06:47:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:47:04,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:47:04,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:47:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1699167601, now seen corresponding path program 1 times [2025-02-08 06:47:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:47:04,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332136357] [2025-02-08 06:47:04,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:47:04,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:47:08,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 06:47:08,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 06:47:08,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:47:08,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:47:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:47:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:47:08,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332136357] [2025-02-08 06:47:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332136357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:47:08,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:47:08,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:47:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773853816] [2025-02-08 06:47:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:47:08,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:47:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:47:08,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:47:08,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:47:08,628 INFO L87 Difference]: Start difference. First operand 155 states and 154 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:13,549 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-02-08 06:47:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:47:14,552 INFO L93 Difference]: Finished difference Result 154 states and 153 transitions. [2025-02-08 06:47:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:47:14,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-02-08 06:47:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:47:14,554 INFO L225 Difference]: With dead ends: 154 [2025-02-08 06:47:14,554 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 06:47:14,554 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-02-08 06:47:14,554 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 67 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:47:14,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 248 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-02-08 06:47:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 06:47:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-02-08 06:47:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 153 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 153 transitions. [2025-02-08 06:47:14,560 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 153 transitions. Word has length 88 [2025-02-08 06:47:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:47:14,560 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 153 transitions. [2025-02-08 06:47:14,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 153 transitions. [2025-02-08 06:47:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 06:47:14,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:47:14,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:47:14,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:47:14,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:47:14,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:47:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1633854470, now seen corresponding path program 1 times [2025-02-08 06:47:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:47:14,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202260558] [2025-02-08 06:47:14,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:47:14,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:47:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 06:47:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 06:47:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:47:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:47:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:47:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:47:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202260558] [2025-02-08 06:47:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202260558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:47:18,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:47:18,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:47:18,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030036474] [2025-02-08 06:47:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:47:18,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:47:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:47:18,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:47:18,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:47:18,361 INFO L87 Difference]: Start difference. First operand 154 states and 153 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:23,317 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-02-08 06:47:27,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:47:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:47:29,113 INFO L93 Difference]: Finished difference Result 153 states and 152 transitions. [2025-02-08 06:47:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:47:29,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2025-02-08 06:47:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:47:29,115 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:47:29,115 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:47:29,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:47:29,115 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:47:29,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 367 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2025-02-08 06:47:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:47:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 06:47:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 135 states have (on average 1.125925925925926) internal successors, (152), 152 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 152 transitions. [2025-02-08 06:47:29,120 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 152 transitions. Word has length 93 [2025-02-08 06:47:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:47:29,120 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 152 transitions. [2025-02-08 06:47:29,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 152 transitions. [2025-02-08 06:47:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 06:47:29,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:47:29,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:47:29,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:47:29,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:47:29,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:47:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1633854471, now seen corresponding path program 1 times [2025-02-08 06:47:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:47:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267608010] [2025-02-08 06:47:29,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:47:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:47:32,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 06:47:32,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 06:47:32,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:47:32,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:47:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:47:33,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:47:33,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267608010] [2025-02-08 06:47:33,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267608010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:47:33,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:47:33,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:47:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265150847] [2025-02-08 06:47:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:47:33,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:47:33,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:47:33,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:47:33,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:47:33,504 INFO L87 Difference]: Start difference. First operand 153 states and 152 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:38,994 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-02-08 06:47:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:47:40,432 INFO L93 Difference]: Finished difference Result 152 states and 151 transitions. [2025-02-08 06:47:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:47:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2025-02-08 06:47:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:47:40,434 INFO L225 Difference]: With dead ends: 152 [2025-02-08 06:47:40,434 INFO L226 Difference]: Without dead ends: 152 [2025-02-08 06:47:40,434 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-02-08 06:47:40,434 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 92 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:47:40,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 298 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2025-02-08 06:47:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-08 06:47:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-08 06:47:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 135 states have (on average 1.1185185185185185) internal successors, (151), 151 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 151 transitions. [2025-02-08 06:47:40,437 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 151 transitions. Word has length 93 [2025-02-08 06:47:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:47:40,438 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 151 transitions. [2025-02-08 06:47:40,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 151 transitions. [2025-02-08 06:47:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 06:47:40,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:47:40,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:47:40,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:47:40,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:47:40,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:47:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash 418621600, now seen corresponding path program 1 times [2025-02-08 06:47:40,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:47:40,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950870941] [2025-02-08 06:47:40,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:47:40,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:47:43,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 06:47:43,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 06:47:43,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:47:43,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:47:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:47:44,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:47:44,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950870941] [2025-02-08 06:47:44,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950870941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:47:44,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:47:44,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:47:44,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157681220] [2025-02-08 06:47:44,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:47:44,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:47:44,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:47:44,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:47:44,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:47:44,248 INFO L87 Difference]: Start difference. First operand 152 states and 151 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 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-02-08 06:47:49,291 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-02-08 06:47:53,580 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-02-08 06:47:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:47:55,050 INFO L93 Difference]: Finished difference Result 151 states and 150 transitions. [2025-02-08 06:47:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:47:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 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) Word has length 98 [2025-02-08 06:47:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:47:55,052 INFO L225 Difference]: With dead ends: 151 [2025-02-08 06:47:55,052 INFO L226 Difference]: Without dead ends: 151 [2025-02-08 06:47:55,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:47:55,053 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 57 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:47:55,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 364 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2025-02-08 06:47:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-08 06:47:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-08 06:47:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 150 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:47:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 150 transitions. [2025-02-08 06:47:55,057 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 150 transitions. Word has length 98 [2025-02-08 06:47:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:47:55,057 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 150 transitions. [2025-02-08 06:47:55,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 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-02-08 06:47:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 150 transitions. [2025-02-08 06:47:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 06:47:55,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:47:55,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:47:55,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:47:55,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-08 06:47:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:47:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 418621601, now seen corresponding path program 1 times [2025-02-08 06:47:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:47:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573696930] [2025-02-08 06:47:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:47:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:47:58,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 06:47:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 06:47:58,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:47:58,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:47:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:47:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:47:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573696930] [2025-02-08 06:47:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573696930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:47:59,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:47:59,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:47:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042199127] [2025-02-08 06:47:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:47:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:47:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:47:59,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:47:59,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:47:59,628 INFO L87 Difference]: Start difference. First operand 151 states and 150 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 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)