./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:30:13,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:30:13,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:30:13,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:30:13,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:30:13,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:30:13,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:30:13,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:30:13,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:30:13,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:30:13,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:30:13,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:30:13,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:30:13,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:30:13,764 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:30:13,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:30:13,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:30:13,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:30:13,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:30:13,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:30:13,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:30:13,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:30:13,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:30:13,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:30:13,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:30:13,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:30:13,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:30:13,768 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 -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2025-01-10 00:30:14,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:30:14,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:30:14,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:30:14,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:30:14,051 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:30:14,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2025-01-10 00:30:15,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/396de6fb2/402b32946b1a497fa7f6deb381d6c2eb/FLAGf08c9f922 [2025-01-10 00:30:15,836 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:30:15,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2025-01-10 00:30:15,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/396de6fb2/402b32946b1a497fa7f6deb381d6c2eb/FLAGf08c9f922 [2025-01-10 00:30:15,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/396de6fb2/402b32946b1a497fa7f6deb381d6c2eb [2025-01-10 00:30:15,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:30:15,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:30:15,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:30:15,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:30:15,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:30:15,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:30:15" (1/1) ... [2025-01-10 00:30:15,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6748e3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:15, skipping insertion in model container [2025-01-10 00:30:15,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:30:15" (1/1) ... [2025-01-10 00:30:15,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:30:16,420 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,439 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,443 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,453 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,461 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,491 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,492 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,494 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,496 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:30:16,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:30:16,513 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:30:16,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:30:16,713 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:30:16,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16 WrapperNode [2025-01-10 00:30:16,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:30:16,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:30:16,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:30:16,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:30:16,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:16,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:16,951 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-01-10 00:30:16,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:30:16,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:30:16,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:30:16,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:30:16,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:16,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:16,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,037 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-01-10 00:30:17,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:30:17,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:30:17,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:30:17,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:30:17,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (1/1) ... [2025-01-10 00:30:17,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:30:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:30:17,239 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-01-10 00:30:17,246 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-01-10 00:30:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:30:17,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:30:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:30:17,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:30:17,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:30:17,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:30:17,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:30:17,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:30:17,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:30:17,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:30:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:30:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:30:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:30:17,267 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:30:17,267 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:30:17,267 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:30:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:30:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:30:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:30:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:30:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:30:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:30:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:30:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:30:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:30:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:30:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:30:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:30:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:30:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:30:17,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:30:17,484 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:30:17,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:30:17,508 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:30:17,538 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:30:17,562 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:30:20,704 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2025-01-10 00:30:20,705 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:30:20,768 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:30:20,773 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 00:30:20,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:30:20 BoogieIcfgContainer [2025-01-10 00:30:20,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:30:20,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:30:20,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:30:20,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:30:20,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:30:15" (1/3) ... [2025-01-10 00:30:20,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62744b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:30:20, skipping insertion in model container [2025-01-10 00:30:20,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:30:16" (2/3) ... [2025-01-10 00:30:20,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62744b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:30:20, skipping insertion in model container [2025-01-10 00:30:20,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:30:20" (3/3) ... [2025-01-10 00:30:20,783 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2025-01-10 00:30:20,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:30:20,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test9-1.i that has 6 procedures, 2074 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-01-10 00:30:20,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:30:20,883 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;@5ce3b6d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:30:20,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-01-10 00:30:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 2064 states, 1134 states have (on average 2.005291005291005) internal successors, (2274), 2057 states have internal predecessors, (2274), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-01-10 00:30:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:30:20,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:20,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:30:20,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:20,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2025-01-10 00:30:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828165419] [2025-01-10 00:30:20,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:20,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:30:21,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:30:21,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:21,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828165419] [2025-01-10 00:30:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828165419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:21,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:21,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:30:21,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240188817] [2025-01-10 00:30:21,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:21,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:30:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:21,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:30:21,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:21,162 INFO L87 Difference]: Start difference. First operand has 2064 states, 1134 states have (on average 2.005291005291005) internal successors, (2274), 2057 states have internal predecessors, (2274), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:22,458 INFO L93 Difference]: Finished difference Result 2050 states and 3214 transitions. [2025-01-10 00:30:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:30:22,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:30:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:22,498 INFO L225 Difference]: With dead ends: 2050 [2025-01-10 00:30:22,498 INFO L226 Difference]: Without dead ends: 2048 [2025-01-10 00:30:22,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:22,502 INFO L435 NwaCegarLoop]: 2825 mSDtfsCounter, 2089 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2592 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:22,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2592 Valid, 2877 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:30:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2025-01-10 00:30:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2025-01-10 00:30:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1136 states have (on average 1.9401408450704225) internal successors, (2204), 2041 states have internal predecessors, (2204), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-10 00:30:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3212 transitions. [2025-01-10 00:30:22,857 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3212 transitions. Word has length 3 [2025-01-10 00:30:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:22,857 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 3212 transitions. [2025-01-10 00:30:22,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3212 transitions. [2025-01-10 00:30:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:30:22,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:22,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:30:22,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:30:22,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:22,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2025-01-10 00:30:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038236720] [2025-01-10 00:30:22,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:22,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:30:22,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:30:22,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:22,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038236720] [2025-01-10 00:30:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038236720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:22,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:30:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936250533] [2025-01-10 00:30:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:22,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:30:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:22,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:30:22,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:22,989 INFO L87 Difference]: Start difference. First operand 2048 states and 3212 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:24,358 INFO L93 Difference]: Finished difference Result 3811 states and 6127 transitions. [2025-01-10 00:30:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:30:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:30:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:24,382 INFO L225 Difference]: With dead ends: 3811 [2025-01-10 00:30:24,382 INFO L226 Difference]: Without dead ends: 3811 [2025-01-10 00:30:24,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:24,384 INFO L435 NwaCegarLoop]: 2927 mSDtfsCounter, 1907 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:24,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 5205 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:30:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2025-01-10 00:30:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 3547. [2025-01-10 00:30:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 2136 states have (on average 1.921816479400749) internal successors, (4105), 3538 states have internal predecessors, (4105), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 6117 transitions. [2025-01-10 00:30:24,680 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 6117 transitions. Word has length 3 [2025-01-10 00:30:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:24,680 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 6117 transitions. [2025-01-10 00:30:24,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 6117 transitions. [2025-01-10 00:30:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:30:24,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:24,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:24,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:30:24,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2025-01-10 00:30:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999250825] [2025-01-10 00:30:24,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:24,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:30:24,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:30:24,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:24,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:24,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999250825] [2025-01-10 00:30:24,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999250825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:30:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057479919] [2025-01-10 00:30:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:24,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:30:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:24,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:30:24,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:24,787 INFO L87 Difference]: Start difference. First operand 3547 states and 6117 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:25,965 INFO L93 Difference]: Finished difference Result 4810 states and 8434 transitions. [2025-01-10 00:30:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:30:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:30:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:25,994 INFO L225 Difference]: With dead ends: 4810 [2025-01-10 00:30:25,995 INFO L226 Difference]: Without dead ends: 4810 [2025-01-10 00:30:25,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:25,998 INFO L435 NwaCegarLoop]: 4985 mSDtfsCounter, 2074 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2577 SdHoareTripleChecker+Valid, 7290 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:25,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2577 Valid, 7290 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:30:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-01-10 00:30:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3500. [2025-01-10 00:30:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2136 states have (on average 1.8885767790262171) internal successors, (4034), 3491 states have internal predecessors, (4034), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 6046 transitions. [2025-01-10 00:30:26,372 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 6046 transitions. Word has length 9 [2025-01-10 00:30:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:26,372 INFO L471 AbstractCegarLoop]: Abstraction has 3500 states and 6046 transitions. [2025-01-10 00:30:26,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 6046 transitions. [2025-01-10 00:30:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:30:26,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:26,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:26,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:30:26,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:26,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2025-01-10 00:30:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507113224] [2025-01-10 00:30:26,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:26,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:30:26,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:30:26,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:26,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:26,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:26,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507113224] [2025-01-10 00:30:26,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507113224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:26,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:26,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:30:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528653211] [2025-01-10 00:30:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:26,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:30:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:26,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:30:26,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:26,491 INFO L87 Difference]: Start difference. First operand 3500 states and 6046 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:27,696 INFO L93 Difference]: Finished difference Result 6020 states and 10782 transitions. [2025-01-10 00:30:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:30:27,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:30:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:27,726 INFO L225 Difference]: With dead ends: 6020 [2025-01-10 00:30:27,727 INFO L226 Difference]: Without dead ends: 6020 [2025-01-10 00:30:27,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:27,728 INFO L435 NwaCegarLoop]: 5120 mSDtfsCounter, 1867 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 7541 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:27,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2369 Valid, 7541 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:30:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2025-01-10 00:30:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3475. [2025-01-10 00:30:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 2136 states have (on average 1.8656367041198503) internal successors, (3985), 3466 states have internal predecessors, (3985), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 5997 transitions. [2025-01-10 00:30:28,141 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 5997 transitions. Word has length 9 [2025-01-10 00:30:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:28,141 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 5997 transitions. [2025-01-10 00:30:28,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 5997 transitions. [2025-01-10 00:30:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 00:30:28,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:28,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:28,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:30:28,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:28,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1259420379, now seen corresponding path program 1 times [2025-01-10 00:30:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379744080] [2025-01-10 00:30:28,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:28,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:30:28,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:30:28,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:28,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379744080] [2025-01-10 00:30:28,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379744080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:28,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:30:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481377351] [2025-01-10 00:30:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:28,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:30:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:28,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:30:28,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:30:28,267 INFO L87 Difference]: Start difference. First operand 3475 states and 5997 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:29,014 INFO L93 Difference]: Finished difference Result 6636 states and 11492 transitions. [2025-01-10 00:30:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:30:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 00:30:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:29,058 INFO L225 Difference]: With dead ends: 6636 [2025-01-10 00:30:29,061 INFO L226 Difference]: Without dead ends: 6636 [2025-01-10 00:30:29,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:30:29,062 INFO L435 NwaCegarLoop]: 3141 mSDtfsCounter, 2088 mSDsluCounter, 5714 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2591 SdHoareTripleChecker+Valid, 8855 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:29,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2591 Valid, 8855 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:30:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2025-01-10 00:30:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 3477. [2025-01-10 00:30:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3477 states, 2138 states have (on average 1.864826941066417) internal successors, (3987), 3468 states have internal predecessors, (3987), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5999 transitions. [2025-01-10 00:30:29,527 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5999 transitions. Word has length 10 [2025-01-10 00:30:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:29,528 INFO L471 AbstractCegarLoop]: Abstraction has 3477 states and 5999 transitions. [2025-01-10 00:30:29,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5999 transitions. [2025-01-10 00:30:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:30:29,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:29,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:29,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:30:29,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash 495194974, now seen corresponding path program 1 times [2025-01-10 00:30:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864110464] [2025-01-10 00:30:29,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:29,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:30:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:30:29,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:29,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864110464] [2025-01-10 00:30:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864110464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:30:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803728544] [2025-01-10 00:30:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:30:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:29,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:30:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:30:29,624 INFO L87 Difference]: Start difference. First operand 3477 states and 5999 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:31,739 INFO L93 Difference]: Finished difference Result 3553 states and 6106 transitions. [2025-01-10 00:30:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:30:31,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 00:30:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:31,755 INFO L225 Difference]: With dead ends: 3553 [2025-01-10 00:30:31,756 INFO L226 Difference]: Without dead ends: 3553 [2025-01-10 00:30:31,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:30:31,758 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 2338 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 4328 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:31,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 4328 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:30:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2025-01-10 00:30:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3454. [2025-01-10 00:30:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2138 states have (on average 1.843311506080449) internal successors, (3941), 3445 states have internal predecessors, (3941), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5953 transitions. [2025-01-10 00:30:31,998 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5953 transitions. Word has length 19 [2025-01-10 00:30:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:31,998 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 5953 transitions. [2025-01-10 00:30:31,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5953 transitions. [2025-01-10 00:30:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:30:31,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:31,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:30:31,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 495194975, now seen corresponding path program 1 times [2025-01-10 00:30:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422499005] [2025-01-10 00:30:32,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:32,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:30:32,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:30:32,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:32,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422499005] [2025-01-10 00:30:32,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422499005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:32,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:32,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:30:32,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887270918] [2025-01-10 00:30:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:32,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:30:32,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:32,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:30:32,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:32,087 INFO L87 Difference]: Start difference. First operand 3454 states and 5953 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:32,126 INFO L93 Difference]: Finished difference Result 3316 states and 5747 transitions. [2025-01-10 00:30:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:30:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 00:30:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:32,136 INFO L225 Difference]: With dead ends: 3316 [2025-01-10 00:30:32,136 INFO L226 Difference]: Without dead ends: 3316 [2025-01-10 00:30:32,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:32,137 INFO L435 NwaCegarLoop]: 2993 mSDtfsCounter, 60 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5933 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:32,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5933 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:30:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2025-01-10 00:30:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 3316. [2025-01-10 00:30:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 2012 states have (on average 1.856361829025845) internal successors, (3735), 3307 states have internal predecessors, (3735), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 5747 transitions. [2025-01-10 00:30:32,366 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 5747 transitions. Word has length 19 [2025-01-10 00:30:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:32,367 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 5747 transitions. [2025-01-10 00:30:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 5747 transitions. [2025-01-10 00:30:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 00:30:32,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:32,368 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] [2025-01-10 00:30:32,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:30:32,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:32,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1828609380, now seen corresponding path program 1 times [2025-01-10 00:30:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850772120] [2025-01-10 00:30:32,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:32,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:30:32,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:30:32,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:32,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:32,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:32,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850772120] [2025-01-10 00:30:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850772120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:32,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:32,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:30:32,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847654107] [2025-01-10 00:30:32,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:32,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:30:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:32,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:30:32,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:30:32,445 INFO L87 Difference]: Start difference. First operand 3316 states and 5747 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-01-10 00:30:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:32,515 INFO L93 Difference]: Finished difference Result 3287 states and 5697 transitions. [2025-01-10 00:30:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:30:32,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-01-10 00:30:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:32,524 INFO L225 Difference]: With dead ends: 3287 [2025-01-10 00:30:32,525 INFO L226 Difference]: Without dead ends: 3287 [2025-01-10 00:30:32,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:30:32,525 INFO L435 NwaCegarLoop]: 2958 mSDtfsCounter, 41 mSDsluCounter, 5888 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8846 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:32,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8846 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:30:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2025-01-10 00:30:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3281. [2025-01-10 00:30:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 1984 states have (on average 1.8543346774193548) internal successors, (3679), 3272 states have internal predecessors, (3679), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5691 transitions. [2025-01-10 00:30:32,832 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5691 transitions. Word has length 20 [2025-01-10 00:30:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:32,832 INFO L471 AbstractCegarLoop]: Abstraction has 3281 states and 5691 transitions. [2025-01-10 00:30:32,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-01-10 00:30:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5691 transitions. [2025-01-10 00:30:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 00:30:32,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:32,833 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] [2025-01-10 00:30:32,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:30:32,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:32,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1048342954, now seen corresponding path program 1 times [2025-01-10 00:30:32,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:32,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007909128] [2025-01-10 00:30:32,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:32,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:32,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:30:32,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:30:32,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:32,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007909128] [2025-01-10 00:30:33,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007909128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:33,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:33,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:30:33,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243195803] [2025-01-10 00:30:33,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:33,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:30:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:33,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:30:33,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:30:33,002 INFO L87 Difference]: Start difference. First operand 3281 states and 5691 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-01-10 00:30:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:35,289 INFO L93 Difference]: Finished difference Result 6055 states and 10800 transitions. [2025-01-10 00:30:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:30:35,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2025-01-10 00:30:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:35,310 INFO L225 Difference]: With dead ends: 6055 [2025-01-10 00:30:35,311 INFO L226 Difference]: Without dead ends: 6055 [2025-01-10 00:30:35,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:30:35,312 INFO L435 NwaCegarLoop]: 2796 mSDtfsCounter, 1816 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 6374 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:35,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 6374 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-10 00:30:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2025-01-10 00:30:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3277. [2025-01-10 00:30:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 1984 states have (on average 1.8503024193548387) internal successors, (3671), 3268 states have internal predecessors, (3671), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 5683 transitions. [2025-01-10 00:30:35,678 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 5683 transitions. Word has length 34 [2025-01-10 00:30:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:35,678 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 5683 transitions. [2025-01-10 00:30:35,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-01-10 00:30:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 5683 transitions. [2025-01-10 00:30:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:30:35,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:35,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:35,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:30:35,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:35,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1085651552, now seen corresponding path program 1 times [2025-01-10 00:30:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118220762] [2025-01-10 00:30:35,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:35,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:30:35,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:30:35,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:35,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118220762] [2025-01-10 00:30:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118220762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:35,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:30:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354367753] [2025-01-10 00:30:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:35,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:30:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:35,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:30:35,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:30:35,797 INFO L87 Difference]: Start difference. First operand 3277 states and 5683 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:35,864 INFO L93 Difference]: Finished difference Result 3277 states and 5675 transitions. [2025-01-10 00:30:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:30:35,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-10 00:30:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:35,874 INFO L225 Difference]: With dead ends: 3277 [2025-01-10 00:30:35,874 INFO L226 Difference]: Without dead ends: 3277 [2025-01-10 00:30:35,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:30:35,875 INFO L435 NwaCegarLoop]: 2953 mSDtfsCounter, 21 mSDsluCounter, 5875 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8828 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:35,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8828 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:30:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-01-10 00:30:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3277. [2025-01-10 00:30:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 1984 states have (on average 1.8462701612903225) internal successors, (3663), 3268 states have internal predecessors, (3663), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:30:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 5675 transitions. [2025-01-10 00:30:36,107 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 5675 transitions. Word has length 68 [2025-01-10 00:30:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:36,108 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 5675 transitions. [2025-01-10 00:30:36,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 5675 transitions. [2025-01-10 00:30:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:30:36,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:36,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:36,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:30:36,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:36,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1491712468, now seen corresponding path program 1 times [2025-01-10 00:30:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:36,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580524633] [2025-01-10 00:30:36,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:36,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:36,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:30:36,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:30:36,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:36,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580524633] [2025-01-10 00:30:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580524633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:30:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99985753] [2025-01-10 00:30:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:36,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:30:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:36,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:30:36,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:36,263 INFO L87 Difference]: Start difference. First operand 3277 states and 5675 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:36,353 INFO L93 Difference]: Finished difference Result 5785 states and 10395 transitions. [2025-01-10 00:30:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:30:36,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:30:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:36,371 INFO L225 Difference]: With dead ends: 5785 [2025-01-10 00:30:36,371 INFO L226 Difference]: Without dead ends: 5785 [2025-01-10 00:30:36,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:30:36,372 INFO L435 NwaCegarLoop]: 3260 mSDtfsCounter, 1353 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 6182 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:36,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 6182 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:30:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2025-01-10 00:30:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5728. [2025-01-10 00:30:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5728 states, 3435 states have (on average 1.8573508005822417) internal successors, (6380), 5719 states have internal predecessors, (6380), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:30:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 10392 transitions. [2025-01-10 00:30:36,692 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 10392 transitions. Word has length 76 [2025-01-10 00:30:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:36,692 INFO L471 AbstractCegarLoop]: Abstraction has 5728 states and 10392 transitions. [2025-01-10 00:30:36,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 10392 transitions. [2025-01-10 00:30:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:30:36,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:36,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:36,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:30:36,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:36,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079487, now seen corresponding path program 1 times [2025-01-10 00:30:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471741340] [2025-01-10 00:30:36,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:36,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:30:36,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:30:36,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:36,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:37,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471741340] [2025-01-10 00:30:37,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471741340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:37,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:30:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171456260] [2025-01-10 00:30:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:30:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:37,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:30:37,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:30:37,033 INFO L87 Difference]: Start difference. First operand 5728 states and 10392 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:37,740 INFO L93 Difference]: Finished difference Result 5727 states and 10390 transitions. [2025-01-10 00:30:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:30:37,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-01-10 00:30:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:37,758 INFO L225 Difference]: With dead ends: 5727 [2025-01-10 00:30:37,759 INFO L226 Difference]: Without dead ends: 5727 [2025-01-10 00:30:37,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:30:37,759 INFO L435 NwaCegarLoop]: 2963 mSDtfsCounter, 2 mSDsluCounter, 7898 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10861 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:37,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10861 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:30:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5727 states. [2025-01-10 00:30:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5727 to 5727. [2025-01-10 00:30:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5727 states, 3435 states have (on average 1.8567685589519651) internal successors, (6378), 5718 states have internal predecessors, (6378), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:30:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5727 states to 5727 states and 10390 transitions. [2025-01-10 00:30:38,094 INFO L78 Accepts]: Start accepts. Automaton has 5727 states and 10390 transitions. Word has length 84 [2025-01-10 00:30:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:38,095 INFO L471 AbstractCegarLoop]: Abstraction has 5727 states and 10390 transitions. [2025-01-10 00:30:38,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5727 states and 10390 transitions. [2025-01-10 00:30:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:30:38,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:38,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:38,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:30:38,098 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:38,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:38,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079488, now seen corresponding path program 1 times [2025-01-10 00:30:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:38,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439999507] [2025-01-10 00:30:38,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:38,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:30:38,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:30:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439999507] [2025-01-10 00:30:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439999507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:38,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:38,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:30:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990164140] [2025-01-10 00:30:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:38,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:30:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:30:38,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:30:38,597 INFO L87 Difference]: Start difference. First operand 5727 states and 10390 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:39,295 INFO L93 Difference]: Finished difference Result 5726 states and 10388 transitions. [2025-01-10 00:30:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:30:39,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-01-10 00:30:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:39,312 INFO L225 Difference]: With dead ends: 5726 [2025-01-10 00:30:39,312 INFO L226 Difference]: Without dead ends: 5726 [2025-01-10 00:30:39,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:30:39,313 INFO L435 NwaCegarLoop]: 2963 mSDtfsCounter, 1 mSDsluCounter, 7836 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10799 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:39,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10799 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:30:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-01-10 00:30:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5726. [2025-01-10 00:30:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 3433 states have (on average 1.8572676958928052) internal successors, (6376), 5717 states have internal predecessors, (6376), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:30:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 10388 transitions. [2025-01-10 00:30:39,832 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 10388 transitions. Word has length 84 [2025-01-10 00:30:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:39,832 INFO L471 AbstractCegarLoop]: Abstraction has 5726 states and 10388 transitions. [2025-01-10 00:30:39,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:30:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 10388 transitions. [2025-01-10 00:30:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:30:39,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:39,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:39,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:30:39,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:39,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash -190598426, now seen corresponding path program 1 times [2025-01-10 00:30:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:39,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513395903] [2025-01-10 00:30:39,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:39,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:30:39,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:30:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:40,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513395903] [2025-01-10 00:30:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513395903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:40,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:40,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:30:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050920138] [2025-01-10 00:30:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:40,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:30:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:40,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:30:40,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:30:40,114 INFO L87 Difference]: Start difference. First operand 5726 states and 10388 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:44,445 INFO L93 Difference]: Finished difference Result 5744 states and 10414 transitions. [2025-01-10 00:30:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:30:44,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-01-10 00:30:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:44,466 INFO L225 Difference]: With dead ends: 5744 [2025-01-10 00:30:44,466 INFO L226 Difference]: Without dead ends: 5744 [2025-01-10 00:30:44,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:30:44,469 INFO L435 NwaCegarLoop]: 2948 mSDtfsCounter, 13 mSDsluCounter, 10014 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12962 SdHoareTripleChecker+Invalid, 4823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:44,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12962 Invalid, 4823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-10 00:30:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2025-01-10 00:30:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5735. [2025-01-10 00:30:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3441 states have (on average 1.856146469049695) internal successors, (6387), 5724 states have internal predecessors, (6387), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-01-10 00:30:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10404 transitions. [2025-01-10 00:30:44,864 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10404 transitions. Word has length 92 [2025-01-10 00:30:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:44,864 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10404 transitions. [2025-01-10 00:30:44,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10404 transitions. [2025-01-10 00:30:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:30:44,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:44,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:44,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:30:44,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:44,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -190598425, now seen corresponding path program 1 times [2025-01-10 00:30:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:44,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009104730] [2025-01-10 00:30:44,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:44,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:44,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:30:44,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:30:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:45,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:45,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009104730] [2025-01-10 00:30:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009104730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:45,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:30:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937612182] [2025-01-10 00:30:45,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:45,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:30:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:45,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:30:45,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:30:45,415 INFO L87 Difference]: Start difference. First operand 5735 states and 10404 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:49,058 INFO L93 Difference]: Finished difference Result 5735 states and 10402 transitions. [2025-01-10 00:30:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:30:49,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-01-10 00:30:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:49,081 INFO L225 Difference]: With dead ends: 5735 [2025-01-10 00:30:49,081 INFO L226 Difference]: Without dead ends: 5735 [2025-01-10 00:30:49,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:30:49,081 INFO L435 NwaCegarLoop]: 2952 mSDtfsCounter, 8 mSDsluCounter, 8150 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11102 SdHoareTripleChecker+Invalid, 3712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:49,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11102 Invalid, 3712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-10 00:30:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2025-01-10 00:30:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5735. [2025-01-10 00:30:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3441 states have (on average 1.8555652426620168) internal successors, (6385), 5724 states have internal predecessors, (6385), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-01-10 00:30:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10402 transitions. [2025-01-10 00:30:49,590 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10402 transitions. Word has length 92 [2025-01-10 00:30:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:49,590 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10402 transitions. [2025-01-10 00:30:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10402 transitions. [2025-01-10 00:30:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:30:49,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:49,591 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-01-10 00:30:49,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:30:49,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:30:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 596220336, now seen corresponding path program 1 times [2025-01-10 00:30:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268263014] [2025-01-10 00:30:49,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:49,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:30:49,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:30:49,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:49,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268263014] [2025-01-10 00:30:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268263014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526723401] [2025-01-10 00:30:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:50,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:30:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:30:50,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:30:50,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:30:50,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:30:50,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:30:50,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:50,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:50,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:30:50,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:30:50,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:30:50,513 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:30:50,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:30:50,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:30:50,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:30:50,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:50,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:30:50,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:30:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:30:50,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:30:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526723401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:50,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:30:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-01-10 00:30:50,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917755620] [2025-01-10 00:30:50,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:30:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:30:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:50,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:30:50,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2025-01-10 00:30:50,982 INFO L87 Difference]: Start difference. First operand 5735 states and 10402 transitions. Second operand has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:31:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:31:01,542 INFO L93 Difference]: Finished difference Result 5742 states and 10408 transitions. [2025-01-10 00:31:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:31:01,543 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-01-10 00:31:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:31:01,560 INFO L225 Difference]: With dead ends: 5742 [2025-01-10 00:31:01,560 INFO L226 Difference]: Without dead ends: 5742 [2025-01-10 00:31:01,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2025-01-10 00:31:01,562 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1871 mSDsluCounter, 20715 mSDsCounter, 0 mSdLazyCounter, 15216 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 23331 SdHoareTripleChecker+Invalid, 15731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 15216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:31:01,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 23331 Invalid, 15731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 15216 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-01-10 00:31:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2025-01-10 00:31:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5739. [2025-01-10 00:31:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5739 states, 3445 states have (on average 1.8542815674891147) internal successors, (6388), 5727 states have internal predecessors, (6388), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-01-10 00:31:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 10402 transitions. [2025-01-10 00:31:02,029 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 10402 transitions. Word has length 93 [2025-01-10 00:31:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:31:02,029 INFO L471 AbstractCegarLoop]: Abstraction has 5739 states and 10402 transitions. [2025-01-10 00:31:02,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:31:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 10402 transitions. [2025-01-10 00:31:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:31:02,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:31:02,030 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-01-10 00:31:02,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:31:02,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:31:02,231 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:31:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:31:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 596220337, now seen corresponding path program 1 times [2025-01-10 00:31:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:31:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250392321] [2025-01-10 00:31:02,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:31:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:31:02,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:31:02,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:31:02,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:31:02,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:31:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:31:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:31:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250392321] [2025-01-10 00:31:02,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250392321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:31:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748909731] [2025-01-10 00:31:02,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:31:02,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:31:02,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:31:02,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:31:02,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:31:03,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:31:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:31:03,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:31:03,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:31:03,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:31:03,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:31:03,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:31:03,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:31:03,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:31:03,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:31:03,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:31:03,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 00:31:03,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:31:03,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:31:03,732 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:31:03,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:31:03,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:31:03,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:31:03,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:31:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:31:03,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:31:03,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748909731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:31:03,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:31:03,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-01-10 00:31:03,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873811609] [2025-01-10 00:31:03,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:31:03,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:31:03,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:31:03,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:31:03,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=344, Unknown=15, NotChecked=0, Total=420 [2025-01-10 00:31:03,949 INFO L87 Difference]: Start difference. First operand 5739 states and 10402 transitions. Second operand has 18 states, 15 states have (on average 9.733333333333333) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:31:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:31:12,866 INFO L93 Difference]: Finished difference Result 5741 states and 10406 transitions. [2025-01-10 00:31:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:31:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.733333333333333) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-01-10 00:31:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:31:12,885 INFO L225 Difference]: With dead ends: 5741 [2025-01-10 00:31:12,885 INFO L226 Difference]: Without dead ends: 5741 [2025-01-10 00:31:12,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=489, Unknown=16, NotChecked=0, Total=600 [2025-01-10 00:31:12,886 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1877 mSDsluCounter, 15037 mSDsCounter, 0 mSdLazyCounter, 9562 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 17656 SdHoareTripleChecker+Invalid, 10585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 9562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:31:12,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2381 Valid, 17656 Invalid, 10585 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1023 Valid, 9562 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-01-10 00:31:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2025-01-10 00:31:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5729. [2025-01-10 00:31:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 3437 states have (on average 1.8553971486761711) internal successors, (6377), 5719 states have internal predecessors, (6377), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:31:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 10389 transitions. [2025-01-10 00:31:13,327 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 10389 transitions. Word has length 93 [2025-01-10 00:31:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:31:13,328 INFO L471 AbstractCegarLoop]: Abstraction has 5729 states and 10389 transitions. [2025-01-10 00:31:13,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.733333333333333) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:31:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 10389 transitions. [2025-01-10 00:31:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:31:13,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:31:13,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:31:13,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:31:13,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 00:31:13,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:31:13,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:31:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash -170304127, now seen corresponding path program 1 times [2025-01-10 00:31:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:31:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800090617] [2025-01-10 00:31:13,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:31:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:31:13,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:31:13,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:31:13,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:31:13,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:31:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:31:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:31:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800090617] [2025-01-10 00:31:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800090617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:31:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:31:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:31:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023192547] [2025-01-10 00:31:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:31:14,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:31:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:31:14,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:31:14,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:31:14,044 INFO L87 Difference]: Start difference. First operand 5729 states and 10389 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:31:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:31:18,620 INFO L93 Difference]: Finished difference Result 5748 states and 10414 transitions. [2025-01-10 00:31:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:31:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-01-10 00:31:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:31:18,633 INFO L225 Difference]: With dead ends: 5748 [2025-01-10 00:31:18,634 INFO L226 Difference]: Without dead ends: 5748 [2025-01-10 00:31:18,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:31:18,635 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1906 mSDsluCounter, 12728 mSDsCounter, 0 mSdLazyCounter, 8406 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 15344 SdHoareTripleChecker+Invalid, 8920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 8406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:31:18,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 15344 Invalid, 8920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 8406 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-10 00:31:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2025-01-10 00:31:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 5744. [2025-01-10 00:31:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5744 states, 3451 states have (on average 1.8527962909301652) internal successors, (6394), 5732 states have internal predecessors, (6394), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-01-10 00:31:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 10408 transitions. [2025-01-10 00:31:19,056 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 10408 transitions. Word has length 95 [2025-01-10 00:31:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:31:19,056 INFO L471 AbstractCegarLoop]: Abstraction has 5744 states and 10408 transitions. [2025-01-10 00:31:19,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:31:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 10408 transitions. [2025-01-10 00:31:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:31:19,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:31:19,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:31:19,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:31:19,058 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:31:19,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:31:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash -170304126, now seen corresponding path program 1 times [2025-01-10 00:31:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:31:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897349685] [2025-01-10 00:31:19,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:31:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:31:19,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:31:19,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:31:19,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:31:19,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:31:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:31:19,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:31:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897349685] [2025-01-10 00:31:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897349685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:31:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:31:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:31:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958364385] [2025-01-10 00:31:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:31:19,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:31:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:31:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:31:19,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:31:19,937 INFO L87 Difference]: Start difference. First operand 5744 states and 10408 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:31:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:31:27,274 INFO L93 Difference]: Finished difference Result 5747 states and 10412 transitions. [2025-01-10 00:31:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:31:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-01-10 00:31:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:31:27,282 INFO L225 Difference]: With dead ends: 5747 [2025-01-10 00:31:27,282 INFO L226 Difference]: Without dead ends: 5747 [2025-01-10 00:31:27,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:31:27,283 INFO L435 NwaCegarLoop]: 2620 mSDtfsCounter, 1881 mSDsluCounter, 15141 mSDsCounter, 0 mSdLazyCounter, 8908 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 17761 SdHoareTripleChecker+Invalid, 9420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 8908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:31:27,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 17761 Invalid, 9420 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 8908 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-01-10 00:31:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2025-01-10 00:31:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5744. [2025-01-10 00:31:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5744 states, 3451 states have (on average 1.8522167487684729) internal successors, (6392), 5732 states have internal predecessors, (6392), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-01-10 00:31:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 10406 transitions. [2025-01-10 00:31:27,635 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 10406 transitions. Word has length 95 [2025-01-10 00:31:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:31:27,636 INFO L471 AbstractCegarLoop]: Abstraction has 5744 states and 10406 transitions. [2025-01-10 00:31:27,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:31:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 10406 transitions. [2025-01-10 00:31:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:31:27,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:31:27,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:31:27,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:31:27,637 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:31:27,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:31:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1984066953, now seen corresponding path program 1 times [2025-01-10 00:31:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:31:27,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081590549] [2025-01-10 00:31:27,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:31:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:31:27,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:31:27,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:31:27,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:31:27,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat