./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:26:07,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:26:07,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:26:07,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:26:07,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:26:07,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:26:07,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:26:07,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:26:07,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:26:07,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:26:07,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:26:07,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:26:07,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:26:07,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:26:07,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:26:07,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:26:07,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:26:07,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:26:07,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:26:07,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:07,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:26:07,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:26:07,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:26:07,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:26:07,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:26:07,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:26:07,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:26:07,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:26:07,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2025-03-09 00:26:07,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:26:07,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:26:07,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:26:07,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:26:07,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:26:07,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-03-09 00:26:08,758 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042f40fa4/20e316f4dd314ec997e8b619dc31d931/FLAG9108ee913 [2025-03-09 00:26:09,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:26:09,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-03-09 00:26:09,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042f40fa4/20e316f4dd314ec997e8b619dc31d931/FLAG9108ee913 [2025-03-09 00:26:09,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042f40fa4/20e316f4dd314ec997e8b619dc31d931 [2025-03-09 00:26:09,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:26:09,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:26:09,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:09,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:26:09,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:26:09,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c39ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09, skipping insertion in model container [2025-03-09 00:26:09,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:26:09,597 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,614 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,617 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,625 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,628 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,638 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,638 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,642 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,643 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,645 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,658 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:09,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:09,688 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:26:09,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:09,837 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:26:09,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09 WrapperNode [2025-03-09 00:26:09,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:09,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:09,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:26:09,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:26:09,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,906 INFO L138 Inliner]: procedures = 346, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 726 [2025-03-09 00:26:09,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:09,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:26:09,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:26:09,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:26:09,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,975 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 2, 355, 12, 12, 2, 1]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 0, 355, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 5, 2, 1, 0]. [2025-03-09 00:26:09,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:10,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:10,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:10,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:10,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:10,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:26:10,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:26:10,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:26:10,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:26:10,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:10,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:10,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:10,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:26:10,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:26:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:26:10,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:26:10,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:26:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 00:26:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 00:26:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 00:26:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 00:26:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:26:10,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:26:10,450 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:26:10,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:26:11,188 INFO L? ?]: Removed 257 outVars from TransFormulas that were not future-live. [2025-03-09 00:26:11,189 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:26:11,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:26:11,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:26:11,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:11 BoogieIcfgContainer [2025-03-09 00:26:11,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:26:11,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:26:11,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:26:11,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:26:11,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:26:09" (1/3) ... [2025-03-09 00:26:11,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b93a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:11, skipping insertion in model container [2025-03-09 00:26:11,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09" (2/3) ... [2025-03-09 00:26:11,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b93a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:11, skipping insertion in model container [2025-03-09 00:26:11,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:11" (3/3) ... [2025-03-09 00:26:11,215 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-1.i [2025-03-09 00:26:11,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:26:11,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-1.i that has 2 procedures, 241 locations, 1 initial locations, 7 loop locations, and 94 error locations. [2025-03-09 00:26:11,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:26:11,275 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;@4ffaf523, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:26:11,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-09 00:26:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 143 states have (on average 1.9230769230769231) internal successors, (275), 237 states have internal predecessors, (275), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:11,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:11,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:11,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:11,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash 325671, now seen corresponding path program 1 times [2025-03-09 00:26:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:11,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727174607] [2025-03-09 00:26:11,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:11,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:11,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:11,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:11,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727174607] [2025-03-09 00:26:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727174607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:11,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:11,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474274887] [2025-03-09 00:26:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:11,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:11,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:11,816 INFO L87 Difference]: Start difference. First operand has 241 states, 143 states have (on average 1.9230769230769231) internal successors, (275), 237 states have internal predecessors, (275), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:12,017 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2025-03-09 00:26:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:26:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:12,027 INFO L225 Difference]: With dead ends: 250 [2025-03-09 00:26:12,028 INFO L226 Difference]: Without dead ends: 248 [2025-03-09 00:26:12,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:12,033 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 234 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:12,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 200 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-09 00:26:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 232. [2025-03-09 00:26:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 228 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 263 transitions. [2025-03-09 00:26:12,086 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 263 transitions. Word has length 3 [2025-03-09 00:26:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:12,087 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 263 transitions. [2025-03-09 00:26:12,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 263 transitions. [2025-03-09 00:26:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:12,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:12,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:12,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:26:12,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:12,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash 325672, now seen corresponding path program 1 times [2025-03-09 00:26:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:12,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216758883] [2025-03-09 00:26:12,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:12,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:12,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:12,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:12,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216758883] [2025-03-09 00:26:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216758883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:12,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:12,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135596545] [2025-03-09 00:26:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:12,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:12,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:12,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:12,310 INFO L87 Difference]: Start difference. First operand 232 states and 263 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:12,432 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2025-03-09 00:26:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:26:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:12,434 INFO L225 Difference]: With dead ends: 231 [2025-03-09 00:26:12,434 INFO L226 Difference]: Without dead ends: 231 [2025-03-09 00:26:12,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:12,434 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:12,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 425 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-09 00:26:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-09 00:26:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 139 states have (on average 1.856115107913669) internal successors, (258), 227 states have internal predecessors, (258), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 262 transitions. [2025-03-09 00:26:12,442 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 262 transitions. Word has length 3 [2025-03-09 00:26:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:12,442 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 262 transitions. [2025-03-09 00:26:12,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 262 transitions. [2025-03-09 00:26:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:26:12,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:12,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:26:12,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:26:12,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:12,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1112391294, now seen corresponding path program 1 times [2025-03-09 00:26:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:12,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370860369] [2025-03-09 00:26:12,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:12,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:26:12,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:26:12,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:12,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:12,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:12,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370860369] [2025-03-09 00:26:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370860369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:12,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743185764] [2025-03-09 00:26:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:12,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:12,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:12,763 INFO L87 Difference]: Start difference. First operand 231 states and 262 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:13,002 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2025-03-09 00:26:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-03-09 00:26:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:13,004 INFO L225 Difference]: With dead ends: 234 [2025-03-09 00:26:13,005 INFO L226 Difference]: Without dead ends: 234 [2025-03-09 00:26:13,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:13,006 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 6 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:13,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 591 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-09 00:26:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-03-09 00:26:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 141 states have (on average 1.8439716312056738) internal successors, (260), 229 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-03-09 00:26:13,019 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 6 [2025-03-09 00:26:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:13,019 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-03-09 00:26:13,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-03-09 00:26:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:26:13,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:13,019 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:13,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:26:13,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:13,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -718389853, now seen corresponding path program 1 times [2025-03-09 00:26:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127855494] [2025-03-09 00:26:13,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:13,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:13,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:13,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:13,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:13,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127855494] [2025-03-09 00:26:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127855494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28883203] [2025-03-09 00:26:13,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:13,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:13,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:13,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:13,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:26:13,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:13,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:13,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:13,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:13,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:26:13,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:13,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:13,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2025-03-09 00:26:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:13,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28883203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:13,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:26:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269434077] [2025-03-09 00:26:13,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:13,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:26:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:13,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:26:13,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:26:13,657 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:14,026 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2025-03-09 00:26:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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-03-09 00:26:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:14,027 INFO L225 Difference]: With dead ends: 236 [2025-03-09 00:26:14,027 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 00:26:14,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:26:14,028 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 490 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:14,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1105 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 00:26:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2025-03-09 00:26:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 143 states have (on average 1.8181818181818181) internal successors, (260), 229 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-03-09 00:26:14,040 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 9 [2025-03-09 00:26:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:14,040 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-03-09 00:26:14,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-03-09 00:26:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:26:14,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:14,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:14,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:26:14,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:14,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -298035145, now seen corresponding path program 1 times [2025-03-09 00:26:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111598463] [2025-03-09 00:26:14,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:26:14,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:26:14,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:14,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111598463] [2025-03-09 00:26:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111598463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330059364] [2025-03-09 00:26:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:14,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:26:14,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:26:14,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:26:14,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:14,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:14,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:26:14,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:14,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330059364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:14,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 00:26:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651505596] [2025-03-09 00:26:14,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:14,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:26:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:14,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:26:14,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:14,698 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:14,729 INFO L93 Difference]: Finished difference Result 245 states and 276 transitions. [2025-03-09 00:26:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-09 00:26:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:14,732 INFO L225 Difference]: With dead ends: 245 [2025-03-09 00:26:14,732 INFO L226 Difference]: Without dead ends: 245 [2025-03-09 00:26:14,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:14,732 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 4 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:14,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 765 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-09 00:26:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-03-09 00:26:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 155 states have (on average 1.7548387096774194) internal successors, (272), 241 states have internal predecessors, (272), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2025-03-09 00:26:14,743 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 18 [2025-03-09 00:26:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:14,743 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2025-03-09 00:26:14,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2025-03-09 00:26:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:26:14,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:14,744 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:14,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:14,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:14,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:14,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1886080009, now seen corresponding path program 2 times [2025-03-09 00:26:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:14,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042908803] [2025-03-09 00:26:14,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:14,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 00:26:14,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 30 statements. [2025-03-09 00:26:14,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:26:14,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 00:26:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042908803] [2025-03-09 00:26:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042908803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:15,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:15,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51108233] [2025-03-09 00:26:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:15,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:15,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:15,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:15,184 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:15,296 INFO L93 Difference]: Finished difference Result 256 states and 288 transitions. [2025-03-09 00:26:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:15,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 30 [2025-03-09 00:26:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:15,300 INFO L225 Difference]: With dead ends: 256 [2025-03-09 00:26:15,300 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 00:26:15,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:15,300 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 218 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:15,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 199 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 00:26:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2025-03-09 00:26:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 155 states have (on average 1.7225806451612904) internal successors, (267), 236 states have internal predecessors, (267), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2025-03-09 00:26:15,309 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 30 [2025-03-09 00:26:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:15,310 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2025-03-09 00:26:15,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2025-03-09 00:26:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:26:15,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:15,310 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:15,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:26:15,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:15,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1886080008, now seen corresponding path program 1 times [2025-03-09 00:26:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978950727] [2025-03-09 00:26:15,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:26:15,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:26:15,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978950727] [2025-03-09 00:26:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978950727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940628291] [2025-03-09 00:26:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:15,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:15,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:15,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:26:15,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:26:15,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:26:15,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:15,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:15,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:26:15,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:15,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940628291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:15,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:15,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-09 00:26:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573822106] [2025-03-09 00:26:15,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:15,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:26:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:15,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:26:15,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:15,951 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:15,993 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2025-03-09 00:26:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-09 00:26:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:15,995 INFO L225 Difference]: With dead ends: 252 [2025-03-09 00:26:15,995 INFO L226 Difference]: Without dead ends: 252 [2025-03-09 00:26:15,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:15,997 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:15,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 750 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-09 00:26:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-09 00:26:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 167 states have (on average 1.6706586826347305) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2025-03-09 00:26:16,003 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 30 [2025-03-09 00:26:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:16,003 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2025-03-09 00:26:16,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2025-03-09 00:26:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 00:26:16,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:16,006 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:16,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:26:16,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:16,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1652649912, now seen corresponding path program 2 times [2025-03-09 00:26:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132218498] [2025-03-09 00:26:16,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:16,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 00:26:16,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-09 00:26:16,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:26:16,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132218498] [2025-03-09 00:26:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132218498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27606802] [2025-03-09 00:26:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:16,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:16,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:16,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:16,585 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:16,818 INFO L93 Difference]: Finished difference Result 414 states and 475 transitions. [2025-03-09 00:26:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 42 [2025-03-09 00:26:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:16,820 INFO L225 Difference]: With dead ends: 414 [2025-03-09 00:26:16,820 INFO L226 Difference]: Without dead ends: 414 [2025-03-09 00:26:16,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:16,821 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 1008 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:16,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 726 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-09 00:26:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 251. [2025-03-09 00:26:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 167 states have (on average 1.6646706586826348) internal successors, (278), 247 states have internal predecessors, (278), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 282 transitions. [2025-03-09 00:26:16,828 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 282 transitions. Word has length 42 [2025-03-09 00:26:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:16,829 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 282 transitions. [2025-03-09 00:26:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 282 transitions. [2025-03-09 00:26:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:26:16,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:16,830 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:16,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:26:16,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash 883633762, now seen corresponding path program 1 times [2025-03-09 00:26:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:16,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689034931] [2025-03-09 00:26:16,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:16,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:26:16,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:26:16,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:16,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689034931] [2025-03-09 00:26:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689034931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:26:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560837968] [2025-03-09 00:26:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:17,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:17,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:17,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:17,193 INFO L87 Difference]: Start difference. First operand 251 states and 282 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:17,421 INFO L93 Difference]: Finished difference Result 285 states and 320 transitions. [2025-03-09 00:26:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:17,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 45 [2025-03-09 00:26:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:17,423 INFO L225 Difference]: With dead ends: 285 [2025-03-09 00:26:17,423 INFO L226 Difference]: Without dead ends: 285 [2025-03-09 00:26:17,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:17,425 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 513 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:17,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 375 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-09 00:26:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2025-03-09 00:26:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 181 states have (on average 1.6519337016574585) internal successors, (299), 260 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 303 transitions. [2025-03-09 00:26:17,436 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 303 transitions. Word has length 45 [2025-03-09 00:26:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:17,436 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 303 transitions. [2025-03-09 00:26:17,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 303 transitions. [2025-03-09 00:26:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:26:17,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:17,436 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:17,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:26:17,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:17,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 883632833, now seen corresponding path program 1 times [2025-03-09 00:26:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669135875] [2025-03-09 00:26:17,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:17,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:26:17,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:26:17,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:17,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669135875] [2025-03-09 00:26:17,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669135875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:17,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:17,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:17,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370013769] [2025-03-09 00:26:17,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:17,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:17,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:17,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:17,583 INFO L87 Difference]: Start difference. First operand 264 states and 303 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:17,741 INFO L93 Difference]: Finished difference Result 295 states and 341 transitions. [2025-03-09 00:26:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 45 [2025-03-09 00:26:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:17,742 INFO L225 Difference]: With dead ends: 295 [2025-03-09 00:26:17,743 INFO L226 Difference]: Without dead ends: 295 [2025-03-09 00:26:17,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:17,743 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 373 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:17,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 265 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-09 00:26:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 257. [2025-03-09 00:26:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 181 states have (on average 1.6132596685082874) internal successors, (292), 253 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 296 transitions. [2025-03-09 00:26:17,748 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 296 transitions. Word has length 45 [2025-03-09 00:26:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:17,748 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 296 transitions. [2025-03-09 00:26:17,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 296 transitions. [2025-03-09 00:26:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:26:17,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:17,749 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:17,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:26:17,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:17,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash 883632834, now seen corresponding path program 1 times [2025-03-09 00:26:17,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:17,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169297345] [2025-03-09 00:26:17,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:17,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:26:17,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:26:17,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:17,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169297345] [2025-03-09 00:26:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169297345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530430011] [2025-03-09 00:26:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:17,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:17,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:17,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:17,973 INFO L87 Difference]: Start difference. First operand 257 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:18,028 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2025-03-09 00:26:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 45 [2025-03-09 00:26:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:18,029 INFO L225 Difference]: With dead ends: 262 [2025-03-09 00:26:18,029 INFO L226 Difference]: Without dead ends: 262 [2025-03-09 00:26:18,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:18,030 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 231 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:18,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 933 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-09 00:26:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 257. [2025-03-09 00:26:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 181 states have (on average 1.6077348066298343) internal successors, (291), 253 states have internal predecessors, (291), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 295 transitions. [2025-03-09 00:26:18,039 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 295 transitions. Word has length 45 [2025-03-09 00:26:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 295 transitions. [2025-03-09 00:26:18,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 295 transitions. [2025-03-09 00:26:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:26:18,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:18,040 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:18,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:26:18,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:18,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash 479060947, now seen corresponding path program 1 times [2025-03-09 00:26:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014103269] [2025-03-09 00:26:18,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:18,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:26:18,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:26:18,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:18,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014103269] [2025-03-09 00:26:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014103269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:26:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190384153] [2025-03-09 00:26:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:18,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:26:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:18,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:26:18,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:18,641 INFO L87 Difference]: Start difference. First operand 257 states and 295 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:19,199 INFO L93 Difference]: Finished difference Result 422 states and 487 transitions. [2025-03-09 00:26:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 48 [2025-03-09 00:26:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:19,201 INFO L225 Difference]: With dead ends: 422 [2025-03-09 00:26:19,201 INFO L226 Difference]: Without dead ends: 422 [2025-03-09 00:26:19,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:26:19,201 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 623 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:19,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 525 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:26:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-09 00:26:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 258. [2025-03-09 00:26:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 183 states have (on average 1.5956284153005464) internal successors, (292), 254 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 296 transitions. [2025-03-09 00:26:19,206 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 296 transitions. Word has length 48 [2025-03-09 00:26:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:19,207 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 296 transitions. [2025-03-09 00:26:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2025-03-09 00:26:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:26:19,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:19,207 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:19,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:26:19,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash -471445094, now seen corresponding path program 1 times [2025-03-09 00:26:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301305434] [2025-03-09 00:26:19,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:19,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:26:19,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:26:19,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:19,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301305434] [2025-03-09 00:26:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301305434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:19,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:19,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611265042] [2025-03-09 00:26:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:19,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:19,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:19,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:19,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:19,443 INFO L87 Difference]: Start difference. First operand 258 states and 296 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:19,605 INFO L93 Difference]: Finished difference Result 257 states and 294 transitions. [2025-03-09 00:26:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:19,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 51 [2025-03-09 00:26:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:19,606 INFO L225 Difference]: With dead ends: 257 [2025-03-09 00:26:19,606 INFO L226 Difference]: Without dead ends: 257 [2025-03-09 00:26:19,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:19,607 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 12 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:19,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 700 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-09 00:26:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-09 00:26:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 183 states have (on average 1.5846994535519126) internal successors, (290), 253 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 294 transitions. [2025-03-09 00:26:19,611 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 294 transitions. Word has length 51 [2025-03-09 00:26:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:19,612 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 294 transitions. [2025-03-09 00:26:19,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 294 transitions. [2025-03-09 00:26:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:26:19,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:19,612 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:19,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:26:19,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:19,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash -471445093, now seen corresponding path program 1 times [2025-03-09 00:26:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416950950] [2025-03-09 00:26:19,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:19,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:26:19,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:26:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416950950] [2025-03-09 00:26:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416950950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077944459] [2025-03-09 00:26:20,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:20,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:20,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:20,011 INFO L87 Difference]: Start difference. First operand 257 states and 294 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:20,184 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2025-03-09 00:26:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:20,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 51 [2025-03-09 00:26:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:20,186 INFO L225 Difference]: With dead ends: 256 [2025-03-09 00:26:20,186 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 00:26:20,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:20,186 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 11 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:20,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 702 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 00:26:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-09 00:26:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 183 states have (on average 1.5737704918032787) internal successors, (288), 252 states have internal predecessors, (288), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2025-03-09 00:26:20,190 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 51 [2025-03-09 00:26:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:20,191 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2025-03-09 00:26:20,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2025-03-09 00:26:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 00:26:20,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:20,193 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:20,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:26:20,193 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:20,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash -12793010, now seen corresponding path program 1 times [2025-03-09 00:26:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:20,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347069961] [2025-03-09 00:26:20,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 00:26:20,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 00:26:20,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:20,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347069961] [2025-03-09 00:26:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347069961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:20,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792156896] [2025-03-09 00:26:20,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:20,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:20,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:20,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:20,292 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:20,311 INFO L93 Difference]: Finished difference Result 268 states and 307 transitions. [2025-03-09 00:26:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:20,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 55 [2025-03-09 00:26:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:20,312 INFO L225 Difference]: With dead ends: 268 [2025-03-09 00:26:20,312 INFO L226 Difference]: Without dead ends: 268 [2025-03-09 00:26:20,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:20,313 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 6 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:20,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 475 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-09 00:26:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2025-03-09 00:26:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 185 states have (on average 1.5675675675675675) internal successors, (290), 254 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 294 transitions. [2025-03-09 00:26:20,317 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 294 transitions. Word has length 55 [2025-03-09 00:26:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:20,317 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 294 transitions. [2025-03-09 00:26:20,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2025-03-09 00:26:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:26:20,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:20,318 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:26:20,318 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:20,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -396336759, now seen corresponding path program 1 times [2025-03-09 00:26:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577198773] [2025-03-09 00:26:20,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:20,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:26:20,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:26:20,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:20,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:20,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577198773] [2025-03-09 00:26:20,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577198773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:20,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:20,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:20,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713676715] [2025-03-09 00:26:20,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:20,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:20,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:20,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:20,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:20,824 INFO L87 Difference]: Start difference. First operand 258 states and 294 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:21,021 INFO L93 Difference]: Finished difference Result 267 states and 305 transitions. [2025-03-09 00:26:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:21,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 56 [2025-03-09 00:26:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:21,022 INFO L225 Difference]: With dead ends: 267 [2025-03-09 00:26:21,022 INFO L226 Difference]: Without dead ends: 267 [2025-03-09 00:26:21,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:21,023 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 17 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:21,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 700 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-09 00:26:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2025-03-09 00:26:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 260 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 303 transitions. [2025-03-09 00:26:21,027 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 303 transitions. Word has length 56 [2025-03-09 00:26:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:21,027 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 303 transitions. [2025-03-09 00:26:21,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 303 transitions. [2025-03-09 00:26:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:26:21,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:21,028 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:21,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:26:21,028 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash -396336760, now seen corresponding path program 1 times [2025-03-09 00:26:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:21,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970899730] [2025-03-09 00:26:21,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:21,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:26:21,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:26:21,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:21,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:21,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:21,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970899730] [2025-03-09 00:26:21,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970899730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:21,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:21,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855339659] [2025-03-09 00:26:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:21,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:21,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:21,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:21,181 INFO L87 Difference]: Start difference. First operand 264 states and 303 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:21,319 INFO L93 Difference]: Finished difference Result 263 states and 299 transitions. [2025-03-09 00:26:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:21,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 56 [2025-03-09 00:26:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:21,320 INFO L225 Difference]: With dead ends: 263 [2025-03-09 00:26:21,320 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 00:26:21,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:21,321 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 5 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:21,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 759 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 00:26:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-09 00:26:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 191 states have (on average 1.544502617801047) internal successors, (295), 259 states have internal predecessors, (295), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 299 transitions. [2025-03-09 00:26:21,325 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 299 transitions. Word has length 56 [2025-03-09 00:26:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:21,325 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 299 transitions. [2025-03-09 00:26:21,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 299 transitions. [2025-03-09 00:26:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 00:26:21,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:21,326 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:21,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:26:21,326 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash 388832485, now seen corresponding path program 1 times [2025-03-09 00:26:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059322789] [2025-03-09 00:26:21,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:21,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:26:21,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:26:21,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:21,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059322789] [2025-03-09 00:26:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059322789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643032737] [2025-03-09 00:26:21,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:21,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:21,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:21,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:21,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:26:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:26:21,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:26:21,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:21,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:21,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:26:21,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:21,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:21,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643032737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:21,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:21,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:26:21,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192289489] [2025-03-09 00:26:21,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:21,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:21,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:21,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:21,783 INFO L87 Difference]: Start difference. First operand 263 states and 299 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:21,809 INFO L93 Difference]: Finished difference Result 290 states and 329 transitions. [2025-03-09 00:26:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 60 [2025-03-09 00:26:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:21,811 INFO L225 Difference]: With dead ends: 290 [2025-03-09 00:26:21,811 INFO L226 Difference]: Without dead ends: 290 [2025-03-09 00:26:21,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:21,811 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 13 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:21,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 946 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-09 00:26:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2025-03-09 00:26:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 215 states have (on average 1.5116279069767442) internal successors, (325), 283 states have internal predecessors, (325), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 329 transitions. [2025-03-09 00:26:21,816 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 329 transitions. Word has length 60 [2025-03-09 00:26:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 329 transitions. [2025-03-09 00:26:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 329 transitions. [2025-03-09 00:26:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 00:26:21,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:21,817 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:21,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:26:22,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 00:26:22,021 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:22,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash -830848302, now seen corresponding path program 1 times [2025-03-09 00:26:22,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:22,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553543977] [2025-03-09 00:26:22,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:22,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:26:22,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:26:22,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553543977] [2025-03-09 00:26:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553543977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676826619] [2025-03-09 00:26:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:22,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:22,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:26:22,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:26:22,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:26:22,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:22,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 00:26:22,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:22,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:26:22,944 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 23 treesize of output 1 [2025-03-09 00:26:22,948 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 23 treesize of output 1 [2025-03-09 00:26:23,102 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 36 treesize of output 12 [2025-03-09 00:26:23,104 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 25 treesize of output 9 [2025-03-09 00:26:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:23,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676826619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:23,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-09 00:26:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289418687] [2025-03-09 00:26:23,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:23,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:26:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:23,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:26:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-03-09 00:26:23,314 INFO L87 Difference]: Start difference. First operand 287 states and 329 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:23,976 INFO L93 Difference]: Finished difference Result 286 states and 323 transitions. [2025-03-09 00:26:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:23,977 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 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 61 [2025-03-09 00:26:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:23,978 INFO L225 Difference]: With dead ends: 286 [2025-03-09 00:26:23,978 INFO L226 Difference]: Without dead ends: 286 [2025-03-09 00:26:23,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:23,979 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 29 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:23,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1934 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:26:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-09 00:26:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-03-09 00:26:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 215 states have (on average 1.4837209302325582) internal successors, (319), 282 states have internal predecessors, (319), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 323 transitions. [2025-03-09 00:26:23,983 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 323 transitions. Word has length 61 [2025-03-09 00:26:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:23,983 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 323 transitions. [2025-03-09 00:26:23,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 323 transitions. [2025-03-09 00:26:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 00:26:23,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:23,984 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:23,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:24,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:24,185 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:24,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 153427982, now seen corresponding path program 2 times [2025-03-09 00:26:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:24,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210295735] [2025-03-09 00:26:24,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:24,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 00:26:24,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:26:24,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:26:24,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210295735] [2025-03-09 00:26:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210295735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709859021] [2025-03-09 00:26:24,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:24,422 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:24,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:26:24,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 00:26:24,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:26:24,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:26:24,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:24,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:26:24,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:24,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:24,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709859021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:24,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:24,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:26:24,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310090218] [2025-03-09 00:26:24,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:24,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:26:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:24,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:26:24,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:24,811 INFO L87 Difference]: Start difference. First operand 286 states and 323 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:24,850 INFO L93 Difference]: Finished difference Result 355 states and 389 transitions. [2025-03-09 00:26:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:24,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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 75 [2025-03-09 00:26:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:24,851 INFO L225 Difference]: With dead ends: 355 [2025-03-09 00:26:24,851 INFO L226 Difference]: Without dead ends: 355 [2025-03-09 00:26:24,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:24,852 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 34 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:24,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 961 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-09 00:26:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2025-03-09 00:26:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 275 states have (on average 1.4) internal successors, (385), 342 states have internal predecessors, (385), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 389 transitions. [2025-03-09 00:26:24,856 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 389 transitions. Word has length 75 [2025-03-09 00:26:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:24,857 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 389 transitions. [2025-03-09 00:26:24,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 389 transitions. [2025-03-09 00:26:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:26:24,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:24,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:24,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:26:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:25,061 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 29104942, now seen corresponding path program 3 times [2025-03-09 00:26:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157309639] [2025-03-09 00:26:25,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:26:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:25,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-09 00:26:25,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-09 00:26:25,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:26:25,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157309639] [2025-03-09 00:26:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157309639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454128840] [2025-03-09 00:26:25,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:26:25,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:25,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:25,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:25,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:26:25,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-09 00:26:25,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-09 00:26:25,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:26:25,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:25,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 00:26:25,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:25,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:25,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 14 [2025-03-09 00:26:25,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:25,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:26,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:26,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 14 [2025-03-09 00:26:26,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:26,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:26,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:27,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:26:27,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2025-03-09 00:26:27,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 62 [2025-03-09 00:26:27,963 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:26:27,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2025-03-09 00:26:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454128840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:27,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:27,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-03-09 00:26:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648509755] [2025-03-09 00:26:27,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:27,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:26:27,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:27,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:26:27,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:26:27,996 INFO L87 Difference]: Start difference. First operand 346 states and 389 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:28,752 INFO L93 Difference]: Finished difference Result 349 states and 382 transitions. [2025-03-09 00:26:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:28,752 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-03-09 00:26:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:28,754 INFO L225 Difference]: With dead ends: 349 [2025-03-09 00:26:28,754 INFO L226 Difference]: Without dead ends: 349 [2025-03-09 00:26:28,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:28,754 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 811 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:28,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1388 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:26:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-09 00:26:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 287. [2025-03-09 00:26:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 220 states have (on average 1.4363636363636363) internal successors, (316), 283 states have internal predecessors, (316), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 320 transitions. [2025-03-09 00:26:28,759 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 320 transitions. Word has length 105 [2025-03-09 00:26:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:28,759 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 320 transitions. [2025-03-09 00:26:28,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:26:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 320 transitions. [2025-03-09 00:26:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:26:28,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:28,759 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:28,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:26:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:28,960 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 29104014, now seen corresponding path program 1 times [2025-03-09 00:26:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401835722] [2025-03-09 00:26:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:29,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:26:29,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:26:29,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:29,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:29,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401835722] [2025-03-09 00:26:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401835722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786166251] [2025-03-09 00:26:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:29,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:29,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:29,629 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:29,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:26:29,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:26:29,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:26:29,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:29,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:29,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 00:26:29,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:30,015 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 00:26:30,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-09 00:26:30,026 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:30,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:30,042 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 23 treesize of output 1 [2025-03-09 00:26:30,341 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 12 treesize of output 4 [2025-03-09 00:26:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-09 00:26:30,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:30,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 45 [2025-03-09 00:26:30,632 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:26:30,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-03-09 00:26:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:30,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786166251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:30,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:30,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 19 [2025-03-09 00:26:30,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886163225] [2025-03-09 00:26:30,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:30,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:30,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:30,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:30,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:30,661 INFO L87 Difference]: Start difference. First operand 287 states and 320 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:31,380 INFO L93 Difference]: Finished difference Result 356 states and 390 transitions. [2025-03-09 00:26:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:26:31,380 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 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 105 [2025-03-09 00:26:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:31,382 INFO L225 Difference]: With dead ends: 356 [2025-03-09 00:26:31,382 INFO L226 Difference]: Without dead ends: 356 [2025-03-09 00:26:31,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=540, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:31,383 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1531 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:31,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 1036 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:26:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-09 00:26:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 284. [2025-03-09 00:26:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 220 states have (on average 1.4227272727272726) internal successors, (313), 280 states have internal predecessors, (313), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 317 transitions. [2025-03-09 00:26:31,389 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 317 transitions. Word has length 105 [2025-03-09 00:26:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:31,389 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 317 transitions. [2025-03-09 00:26:31,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 317 transitions. [2025-03-09 00:26:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 00:26:31,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:31,390 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:31,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:26:31,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 00:26:31,591 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash -517852281, now seen corresponding path program 1 times [2025-03-09 00:26:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951384515] [2025-03-09 00:26:31,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:31,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 00:26:31,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 00:26:31,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:31,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951384515] [2025-03-09 00:26:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951384515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91108443] [2025-03-09 00:26:32,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:32,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:32,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:32,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:32,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:26:32,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 00:26:32,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 00:26:32,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:32,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:32,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:26:32,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:32,934 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 11 treesize of output 5 [2025-03-09 00:26:32,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:26:32,954 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-09 00:26:32,954 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 1 case distinctions, treesize of input 21 treesize of output 23 [2025-03-09 00:26:33,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:33,089 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-09 00:26:33,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2025-03-09 00:26:33,102 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:33,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:33,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:33,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 25 [2025-03-09 00:26:33,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:33,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:33,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:35,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:26:35,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 00:26:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91108443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:35,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:35,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-03-09 00:26:35,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410801198] [2025-03-09 00:26:35,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:35,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:26:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:35,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:26:35,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:26:35,272 INFO L87 Difference]: Start difference. First operand 284 states and 317 transitions. Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:36,330 INFO L93 Difference]: Finished difference Result 532 states and 585 transitions. [2025-03-09 00:26:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:26:36,330 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 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 108 [2025-03-09 00:26:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:36,332 INFO L225 Difference]: With dead ends: 532 [2025-03-09 00:26:36,332 INFO L226 Difference]: Without dead ends: 532 [2025-03-09 00:26:36,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 00:26:36,333 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1349 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:36,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 928 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:26:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-09 00:26:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 279. [2025-03-09 00:26:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 216 states have (on average 1.4259259259259258) internal successors, (308), 275 states have internal predecessors, (308), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 312 transitions. [2025-03-09 00:26:36,337 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 312 transitions. Word has length 108 [2025-03-09 00:26:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:36,337 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 312 transitions. [2025-03-09 00:26:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 312 transitions. [2025-03-09 00:26:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 00:26:36,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:36,338 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:36,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:36,539 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:36,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash 268459939, now seen corresponding path program 1 times [2025-03-09 00:26:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:36,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707014704] [2025-03-09 00:26:36,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:36,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:36,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 00:26:36,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 00:26:36,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:36,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:37,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707014704] [2025-03-09 00:26:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707014704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:37,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:37,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:26:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335899551] [2025-03-09 00:26:37,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:37,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:37,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:37,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:37,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:37,010 INFO L87 Difference]: Start difference. First operand 279 states and 312 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:37,173 INFO L93 Difference]: Finished difference Result 326 states and 370 transitions. [2025-03-09 00:26:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:37,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 109 [2025-03-09 00:26:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:37,175 INFO L225 Difference]: With dead ends: 326 [2025-03-09 00:26:37,175 INFO L226 Difference]: Without dead ends: 326 [2025-03-09 00:26:37,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:37,175 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 360 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:37,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 637 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-09 00:26:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 284. [2025-03-09 00:26:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 221 states have (on average 1.420814479638009) internal successors, (314), 280 states have internal predecessors, (314), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 318 transitions. [2025-03-09 00:26:37,181 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 318 transitions. Word has length 109 [2025-03-09 00:26:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:37,181 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 318 transitions. [2025-03-09 00:26:37,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 318 transitions. [2025-03-09 00:26:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 00:26:37,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:37,182 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:37,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 00:26:37,182 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:37,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1614946494, now seen corresponding path program 1 times [2025-03-09 00:26:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247413150] [2025-03-09 00:26:37,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:37,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 00:26:37,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 00:26:37,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:37,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247413150] [2025-03-09 00:26:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247413150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773811638] [2025-03-09 00:26:39,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:39,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:39,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:39,782 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:39,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:26:39,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 00:26:40,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 00:26:40,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:40,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:40,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:26:40,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:40,120 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 15 treesize of output 11 [2025-03-09 00:26:40,123 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 15 treesize of output 11 [2025-03-09 00:26:40,169 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-09 00:26:40,169 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-09 00:26:40,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:40,175 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 27 treesize of output 15 [2025-03-09 00:26:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:40,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773811638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:40,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:40,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-09 00:26:40,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719419639] [2025-03-09 00:26:40,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:40,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:40,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:40,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:40,957 INFO L87 Difference]: Start difference. First operand 284 states and 318 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:41,573 INFO L93 Difference]: Finished difference Result 452 states and 511 transitions. [2025-03-09 00:26:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 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 112 [2025-03-09 00:26:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:41,575 INFO L225 Difference]: With dead ends: 452 [2025-03-09 00:26:41,575 INFO L226 Difference]: Without dead ends: 452 [2025-03-09 00:26:41,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2025-03-09 00:26:41,576 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1065 mSDsluCounter, 2792 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:41,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 3023 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-09 00:26:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 346. [2025-03-09 00:26:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 283 states have (on average 1.3356890459363957) internal successors, (378), 342 states have internal predecessors, (378), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 382 transitions. [2025-03-09 00:26:41,587 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 382 transitions. Word has length 112 [2025-03-09 00:26:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:41,587 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 382 transitions. [2025-03-09 00:26:41,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 382 transitions. [2025-03-09 00:26:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 00:26:41,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:41,588 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:41,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:26:41,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 00:26:41,788 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:41,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash 461044773, now seen corresponding path program 1 times [2025-03-09 00:26:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167129311] [2025-03-09 00:26:41,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:41,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 00:26:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 00:26:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:41,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167129311] [2025-03-09 00:26:42,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167129311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:42,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:42,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:26:42,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282521925] [2025-03-09 00:26:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:42,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:42,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:42,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:42,185 INFO L87 Difference]: Start difference. First operand 346 states and 382 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:42,270 INFO L93 Difference]: Finished difference Result 383 states and 427 transitions. [2025-03-09 00:26:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 112 [2025-03-09 00:26:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:42,271 INFO L225 Difference]: With dead ends: 383 [2025-03-09 00:26:42,271 INFO L226 Difference]: Without dead ends: 383 [2025-03-09 00:26:42,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:42,272 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 42 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:42,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1288 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-09 00:26:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 352. [2025-03-09 00:26:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 289 states have (on average 1.3321799307958477) internal successors, (385), 348 states have internal predecessors, (385), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 389 transitions. [2025-03-09 00:26:42,276 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 389 transitions. Word has length 112 [2025-03-09 00:26:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:42,276 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 389 transitions. [2025-03-09 00:26:42,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 389 transitions. [2025-03-09 00:26:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 00:26:42,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:42,277 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:42,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 00:26:42,277 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:42,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash -319988389, now seen corresponding path program 1 times [2025-03-09 00:26:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105648196] [2025-03-09 00:26:42,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:42,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 00:26:42,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 00:26:42,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:42,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:42,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:42,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105648196] [2025-03-09 00:26:42,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105648196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:42,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:42,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:42,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638007182] [2025-03-09 00:26:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:42,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:42,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:42,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:42,426 INFO L87 Difference]: Start difference. First operand 352 states and 389 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:42,437 INFO L93 Difference]: Finished difference Result 354 states and 391 transitions. [2025-03-09 00:26:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 115 [2025-03-09 00:26:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:42,439 INFO L225 Difference]: With dead ends: 354 [2025-03-09 00:26:42,439 INFO L226 Difference]: Without dead ends: 354 [2025-03-09 00:26:42,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:42,439 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:42,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-09 00:26:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-09 00:26:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 350 states have internal predecessors, (387), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 391 transitions. [2025-03-09 00:26:42,444 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 391 transitions. Word has length 115 [2025-03-09 00:26:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:42,444 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 391 transitions. [2025-03-09 00:26:42,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 391 transitions. [2025-03-09 00:26:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-09 00:26:42,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:42,445 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:42,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 00:26:42,445 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:42,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1728826830, now seen corresponding path program 1 times [2025-03-09 00:26:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053065243] [2025-03-09 00:26:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:42,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-09 00:26:42,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 00:26:42,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053065243] [2025-03-09 00:26:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053065243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425880612] [2025-03-09 00:26:42,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:42,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:42,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:42,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:42,760 INFO L87 Difference]: Start difference. First operand 354 states and 391 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:42,881 INFO L93 Difference]: Finished difference Result 353 states and 390 transitions. [2025-03-09 00:26:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:42,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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 117 [2025-03-09 00:26:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:42,883 INFO L225 Difference]: With dead ends: 353 [2025-03-09 00:26:42,883 INFO L226 Difference]: Without dead ends: 353 [2025-03-09 00:26:42,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:42,884 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:42,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-09 00:26:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-09 00:26:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 291 states have (on average 1.3264604810996563) internal successors, (386), 349 states have internal predecessors, (386), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 390 transitions. [2025-03-09 00:26:42,897 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 390 transitions. Word has length 117 [2025-03-09 00:26:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:42,897 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 390 transitions. [2025-03-09 00:26:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 390 transitions. [2025-03-09 00:26:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-09 00:26:42,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:42,898 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 00:26:42,899 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1728826829, now seen corresponding path program 1 times [2025-03-09 00:26:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646623203] [2025-03-09 00:26:42,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:42,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-09 00:26:42,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 00:26:42,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:42,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646623203] [2025-03-09 00:26:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646623203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9677695] [2025-03-09 00:26:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:43,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:43,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:43,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:43,145 INFO L87 Difference]: Start difference. First operand 353 states and 390 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:43,207 INFO L93 Difference]: Finished difference Result 353 states and 390 transitions. [2025-03-09 00:26:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:43,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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 117 [2025-03-09 00:26:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:43,209 INFO L225 Difference]: With dead ends: 353 [2025-03-09 00:26:43,209 INFO L226 Difference]: Without dead ends: 353 [2025-03-09 00:26:43,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:43,209 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:43,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-09 00:26:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2025-03-09 00:26:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 291 states have (on average 1.3230240549828178) internal successors, (385), 348 states have internal predecessors, (385), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 389 transitions. [2025-03-09 00:26:43,214 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 389 transitions. Word has length 117 [2025-03-09 00:26:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:43,214 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 389 transitions. [2025-03-09 00:26:43,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 389 transitions. [2025-03-09 00:26:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-09 00:26:43,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:43,215 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:43,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 00:26:43,215 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:43,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1771412246, now seen corresponding path program 1 times [2025-03-09 00:26:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:43,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723744948] [2025-03-09 00:26:43,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:43,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-09 00:26:43,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-09 00:26:43,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:43,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723744948] [2025-03-09 00:26:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723744948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:43,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:43,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964801695] [2025-03-09 00:26:43,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:43,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:43,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:43,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:43,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:43,379 INFO L87 Difference]: Start difference. First operand 352 states and 389 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:43,394 INFO L93 Difference]: Finished difference Result 356 states and 394 transitions. [2025-03-09 00:26:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:43,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 120 [2025-03-09 00:26:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:43,395 INFO L225 Difference]: With dead ends: 356 [2025-03-09 00:26:43,395 INFO L226 Difference]: Without dead ends: 356 [2025-03-09 00:26:43,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:43,396 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 2 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:43,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 671 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-09 00:26:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2025-03-09 00:26:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 293 states have (on average 1.3208191126279865) internal successors, (387), 350 states have internal predecessors, (387), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 391 transitions. [2025-03-09 00:26:43,400 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 391 transitions. Word has length 120 [2025-03-09 00:26:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:43,400 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 391 transitions. [2025-03-09 00:26:43,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 391 transitions. [2025-03-09 00:26:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-09 00:26:43,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:43,401 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:43,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 00:26:43,402 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:43,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1037189832, now seen corresponding path program 1 times [2025-03-09 00:26:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341542173] [2025-03-09 00:26:43,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:43,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-09 00:26:43,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 00:26:43,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:43,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:43,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341542173] [2025-03-09 00:26:43,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341542173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:43,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 00:26:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126614013] [2025-03-09 00:26:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:43,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:26:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:43,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:26:43,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:43,655 INFO L87 Difference]: Start difference. First operand 354 states and 391 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:43,728 INFO L93 Difference]: Finished difference Result 369 states and 410 transitions. [2025-03-09 00:26:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 121 [2025-03-09 00:26:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:43,729 INFO L225 Difference]: With dead ends: 369 [2025-03-09 00:26:43,729 INFO L226 Difference]: Without dead ends: 369 [2025-03-09 00:26:43,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:43,730 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 19 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:43,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1261 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-09 00:26:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2025-03-09 00:26:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 302 states have (on average 1.3178807947019868) internal successors, (398), 359 states have internal predecessors, (398), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 402 transitions. [2025-03-09 00:26:43,734 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 402 transitions. Word has length 121 [2025-03-09 00:26:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:43,735 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 402 transitions. [2025-03-09 00:26:43,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 402 transitions. [2025-03-09 00:26:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 00:26:43,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:43,736 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:43,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 00:26:43,736 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:43,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1527812448, now seen corresponding path program 1 times [2025-03-09 00:26:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:43,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264919736] [2025-03-09 00:26:43,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:43,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 00:26:43,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 00:26:43,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:43,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264919736] [2025-03-09 00:26:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264919736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43713457] [2025-03-09 00:26:44,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:44,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:44,057 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:44,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:26:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 00:26:44,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 00:26:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:44,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:44,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 00:26:44,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:44,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43713457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:44,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 00:26:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830847129] [2025-03-09 00:26:44,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:44,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:26:44,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:44,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:26:44,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:26:44,815 INFO L87 Difference]: Start difference. First operand 363 states and 402 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:44,902 INFO L93 Difference]: Finished difference Result 503 states and 558 transitions. [2025-03-09 00:26:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 122 [2025-03-09 00:26:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:44,904 INFO L225 Difference]: With dead ends: 503 [2025-03-09 00:26:44,904 INFO L226 Difference]: Without dead ends: 503 [2025-03-09 00:26:44,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:26:44,905 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 130 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:44,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1173 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-09 00:26:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 364. [2025-03-09 00:26:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 303 states have (on average 1.316831683168317) internal successors, (399), 360 states have internal predecessors, (399), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 403 transitions. [2025-03-09 00:26:44,912 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 403 transitions. Word has length 122 [2025-03-09 00:26:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:44,913 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 403 transitions. [2025-03-09 00:26:44,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 403 transitions. [2025-03-09 00:26:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 00:26:44,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:44,914 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:44,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:45,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-09 00:26:45,115 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 334621466, now seen corresponding path program 1 times [2025-03-09 00:26:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878015858] [2025-03-09 00:26:45,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:45,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 00:26:45,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 00:26:45,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:45,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:26:45,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:26:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 00:26:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 00:26:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:45,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:26:45,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:26:45,389 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:26:45,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE (93 of 94 remaining) [2025-03-09 00:26:45,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (92 of 94 remaining) [2025-03-09 00:26:45,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (91 of 94 remaining) [2025-03-09 00:26:45,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (90 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (89 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (88 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (87 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (86 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (85 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (84 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (83 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (82 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (81 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (80 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2025-03-09 00:26:45,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2025-03-09 00:26:45,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2025-03-09 00:26:45,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2025-03-09 00:26:45,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2025-03-09 00:26:45,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2025-03-09 00:26:45,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2025-03-09 00:26:45,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2025-03-09 00:26:45,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2025-03-09 00:26:45,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (44 of 94 remaining) [2025-03-09 00:26:45,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE (28 of 94 remaining) [2025-03-09 00:26:45,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2025-03-09 00:26:45,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 94 remaining) [2025-03-09 00:26:45,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 00:26:45,405 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:45,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:26:45,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:26:45 BoogieIcfgContainer [2025-03-09 00:26:45,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:26:45,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:26:45,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:26:45,498 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:26:45,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:11" (3/4) ... [2025-03-09 00:26:45,500 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:26:45,501 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:26:45,502 INFO L158 Benchmark]: Toolchain (without parser) took 36418.38ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 119.7MB in the beginning and 337.1MB in the end (delta: -217.3MB). Peak memory consumption was 266.5MB. Max. memory is 16.1GB. [2025-03-09 00:26:45,502 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:26:45,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.56ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 73.6MB in the end (delta: 45.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 00:26:45,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.14ms. Allocated memory is still 167.8MB. Free memory was 73.6MB in the beginning and 66.8MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:26:45,502 INFO L158 Benchmark]: Boogie Preprocessor took 142.78ms. Allocated memory is still 167.8MB. Free memory was 66.8MB in the beginning and 56.8MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 00:26:45,502 INFO L158 Benchmark]: IcfgBuilder took 1153.90ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 57.6MB in the end (delta: -783.9kB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2025-03-09 00:26:45,503 INFO L158 Benchmark]: TraceAbstraction took 34290.62ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 56.8MB in the beginning and 337.2MB in the end (delta: -280.4MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. [2025-03-09 00:26:45,503 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 645.9MB. Free memory was 337.2MB in the beginning and 337.1MB in the end (delta: 109.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:26:45,504 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.56ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 73.6MB in the end (delta: 45.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.14ms. Allocated memory is still 167.8MB. Free memory was 73.6MB in the beginning and 66.8MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 142.78ms. Allocated memory is still 167.8MB. Free memory was 66.8MB in the beginning and 56.8MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1153.90ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 57.6MB in the end (delta: -783.9kB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34290.62ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 56.8MB in the beginning and 337.2MB in the end (delta: -280.4MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 645.9MB. Free memory was 337.2MB in the beginning and 337.1MB in the end (delta: 109.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=10] [L1577] COND FALSE !(i<10) [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [a={-1:0}, applet_name={-1:0}, argc=1, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1587] int i=0; VAL [a={-1:0}, applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0, mem_track={-12:0}, optind=1] [L1587] COND TRUE i= 2u [L1394] FCALL bb_show_usage() [L1395] argv = argv + 1l VAL [applet_name={-1:0}, argv={-13:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND FALSE !(!(s == ((const char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, c=47, dummy_utmp={10:0}, optind=1] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] strlen(s) VAL [applet_name={-1:0}, argv={-13:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] - UnprovableResult [Line: 1573]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 241 locations, 281 edges, 94 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 33, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9162 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9145 mSDsluCounter, 26894 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20122 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8805 IncrementalHoareTripleChecker+Invalid, 8986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 6772 mSDtfsCounter, 8805 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1817 GetRequests, 1541 SyntacticMatches, 7 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=32, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 1166 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 2878 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3708 ConstructedInterpolants, 126 QuantifiedInterpolants, 29683 SizeOfPredicates, 51 NumberOfNonLiveVariables, 13817 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 54 InterpolantComputations, 21 PerfectInterpolantSequences, 11151/11508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 00:26:45,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:26:47,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:26:47,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2025-03-09 00:26:47,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:26:47,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:26:47,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:26:47,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:26:47,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:26:47,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:26:47,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:26:47,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:26:47,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:26:47,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:26:47,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:26:47,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:26:47,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:26:47,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:26:47,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:26:47,624 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:26:47,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:26:47,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:47,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:26:47,626 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2025-03-09 00:26:47,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:26:47,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:26:47,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:26:47,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:26:47,909 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:26:47,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-03-09 00:26:49,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd8f3b6c/130d0d64814c493aa38a6481c63137ff/FLAG795f46645 [2025-03-09 00:26:49,331 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:26:49,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-03-09 00:26:49,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd8f3b6c/130d0d64814c493aa38a6481c63137ff/FLAG795f46645 [2025-03-09 00:26:49,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd8f3b6c/130d0d64814c493aa38a6481c63137ff [2025-03-09 00:26:49,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:26:49,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:26:49,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:49,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:26:49,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:26:49,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:49" (1/1) ... [2025-03-09 00:26:49,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee400ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:49, skipping insertion in model container [2025-03-09 00:26:49,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:49" (1/1) ... [2025-03-09 00:26:49,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:26:50,134 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,149 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,152 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,155 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,157 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,165 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,165 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,166 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,170 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,172 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,191 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:50,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:50,240 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:26:50,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:50,466 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:26:50,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50 WrapperNode [2025-03-09 00:26:50,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:50,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:50,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:26:50,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:26:50,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,589 INFO L138 Inliner]: procedures = 353, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 718 [2025-03-09 00:26:50,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:50,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:26:50,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:26:50,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:26:50,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,654 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 2, 3, 3, 3, 4, 4, 4, 12, 3, 355, 2, 12, 1]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 0, 3, 3, 3, 3, 3, 3, 0, 3, 355, 0, 0, 0]. The 10 writes are split as follows [0, 2, 0, 0, 0, 0, 0, 0, 5, 0, 0, 1, 2, 0]. [2025-03-09 00:26:50,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:26:50,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:26:50,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:26:50,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:26:50,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (1/1) ... [2025-03-09 00:26:50,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:50,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:50,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:26:50,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:26:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-09 00:26:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-09 00:26:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-09 00:26:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-09 00:26:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-09 00:26:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:26:50,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-09 00:26:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-09 00:26:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-09 00:26:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-09 00:26:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-09 00:26:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-09 00:26:50,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:26:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 00:26:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 00:26:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 00:26:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 00:26:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:26:50,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:26:51,102 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:26:51,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:26:52,135 INFO L? ?]: Removed 257 outVars from TransFormulas that were not future-live. [2025-03-09 00:26:52,136 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:26:52,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:26:52,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:26:52,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:52 BoogieIcfgContainer [2025-03-09 00:26:52,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:26:52,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:26:52,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:26:52,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:26:52,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:26:49" (1/3) ... [2025-03-09 00:26:52,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7c58fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:52, skipping insertion in model container [2025-03-09 00:26:52,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:50" (2/3) ... [2025-03-09 00:26:52,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7c58fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:52, skipping insertion in model container [2025-03-09 00:26:52,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:52" (3/3) ... [2025-03-09 00:26:52,160 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-1.i [2025-03-09 00:26:52,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:26:52,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-1.i that has 2 procedures, 241 locations, 1 initial locations, 7 loop locations, and 94 error locations. [2025-03-09 00:26:52,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:26:52,221 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;@60b2eca3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:26:52,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-09 00:26:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 143 states have (on average 1.9230769230769231) internal successors, (275), 237 states have internal predecessors, (275), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:52,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:52,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:52,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash 325671, now seen corresponding path program 1 times [2025-03-09 00:26:52,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:26:52,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691544809] [2025-03-09 00:26:52,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:52,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:52,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:52,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:52,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:26:52,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:52,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:52,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:52,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:52,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:26:52,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:53,009 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 7 [2025-03-09 00:26:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:53,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:26:53,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:26:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691544809] [2025-03-09 00:26:53,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691544809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637470113] [2025-03-09 00:26:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:53,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:26:53,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:53,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:53,065 INFO L87 Difference]: Start difference. First operand has 241 states, 143 states have (on average 1.9230769230769231) internal successors, (275), 237 states have internal predecessors, (275), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:53,446 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2025-03-09 00:26:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:53,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:26:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:53,455 INFO L225 Difference]: With dead ends: 250 [2025-03-09 00:26:53,455 INFO L226 Difference]: Without dead ends: 248 [2025-03-09 00:26:53,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:53,459 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 234 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:53,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 200 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-09 00:26:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 232. [2025-03-09 00:26:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 228 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 263 transitions. [2025-03-09 00:26:53,500 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 263 transitions. Word has length 3 [2025-03-09 00:26:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:53,500 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 263 transitions. [2025-03-09 00:26:53,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 263 transitions. [2025-03-09 00:26:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:53,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:53,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:53,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:53,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 325672, now seen corresponding path program 1 times [2025-03-09 00:26:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:26:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944148856] [2025-03-09 00:26:53,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:53,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:53,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:53,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:53,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:26:53,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:54,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:54,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:54,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:26:54,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:54,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:26:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:54,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:26:54,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:26:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944148856] [2025-03-09 00:26:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944148856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:54,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493907916] [2025-03-09 00:26:54,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:54,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:26:54,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:54,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:54,380 INFO L87 Difference]: Start difference. First operand 232 states and 263 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:54,864 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2025-03-09 00:26:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:54,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:26:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:54,866 INFO L225 Difference]: With dead ends: 231 [2025-03-09 00:26:54,866 INFO L226 Difference]: Without dead ends: 231 [2025-03-09 00:26:54,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:54,867 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:54,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 425 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:26:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-09 00:26:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-09 00:26:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 139 states have (on average 1.856115107913669) internal successors, (258), 227 states have internal predecessors, (258), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 262 transitions. [2025-03-09 00:26:54,880 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 262 transitions. Word has length 3 [2025-03-09 00:26:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:54,880 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 262 transitions. [2025-03-09 00:26:54,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 262 transitions. [2025-03-09 00:26:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:26:54,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:54,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:26:54,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:55,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:55,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1112391294, now seen corresponding path program 1 times [2025-03-09 00:26:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:26:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624310137] [2025-03-09 00:26:55,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:55,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:55,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:55,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:55,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:26:55,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:26:55,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:26:55,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:55,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:55,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:26:55,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:55,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:26:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:55,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:26:55,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:26:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624310137] [2025-03-09 00:26:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624310137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:55,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:55,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849250804] [2025-03-09 00:26:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:55,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:55,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:26:55,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:55,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:55,767 INFO L87 Difference]: Start difference. First operand 231 states and 262 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:56,232 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2025-03-09 00:26:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:56,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-03-09 00:26:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:56,234 INFO L225 Difference]: With dead ends: 234 [2025-03-09 00:26:56,234 INFO L226 Difference]: Without dead ends: 234 [2025-03-09 00:26:56,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:56,235 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 7 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:56,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 423 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:26:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-09 00:26:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-03-09 00:26:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 141 states have (on average 1.8439716312056738) internal successors, (260), 229 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-03-09 00:26:56,242 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 6 [2025-03-09 00:26:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:56,242 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-03-09 00:26:56,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-03-09 00:26:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:26:56,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:56,242 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:56,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:26:56,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:56,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:26:56,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -718389853, now seen corresponding path program 1 times [2025-03-09 00:26:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:26:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367239485] [2025-03-09 00:26:56,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:56,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:56,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:56,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:56,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:26:56,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:56,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:56,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:56,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:57,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:26:57,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:57,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:26:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:57,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:57,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:26:57,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367239485] [2025-03-09 00:26:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367239485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:57,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:26:57,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 00:26:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711220347] [2025-03-09 00:26:57,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:57,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:26:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:26:57,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:26:57,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:57,402 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:00,038 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2025-03-09 00:27:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:27:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:27:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:00,040 INFO L225 Difference]: With dead ends: 237 [2025-03-09 00:27:00,040 INFO L226 Difference]: Without dead ends: 237 [2025-03-09 00:27:00,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:27:00,041 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 10 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:00,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 927 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-09 00:27:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-09 00:27:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-03-09 00:27:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 146 states have (on average 1.8082191780821917) internal successors, (264), 233 states have internal predecessors, (264), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 268 transitions. [2025-03-09 00:27:00,055 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 268 transitions. Word has length 9 [2025-03-09 00:27:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:00,056 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 268 transitions. [2025-03-09 00:27:00,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 268 transitions. [2025-03-09 00:27:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 00:27:00,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:00,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:00,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:27:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:00,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:27:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1438234660, now seen corresponding path program 1 times [2025-03-09 00:27:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:27:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933387819] [2025-03-09 00:27:00,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:00,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:00,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:00,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:27:00,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:27:00,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:27:00,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:00,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:00,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:27:00,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:00,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:27:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:01,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:01,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:27:01,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933387819] [2025-03-09 00:27:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933387819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:01,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:27:01,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-09 00:27:01,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161842219] [2025-03-09 00:27:01,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:01,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:27:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:27:01,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:27:01,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:27:01,450 INFO L87 Difference]: Start difference. First operand 237 states and 268 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:03,040 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2025-03-09 00:27:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:27:03,045 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 00:27:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:03,046 INFO L225 Difference]: With dead ends: 252 [2025-03-09 00:27:03,046 INFO L226 Difference]: Without dead ends: 252 [2025-03-09 00:27:03,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:27:03,046 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 35 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:03,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1180 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:27:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-09 00:27:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-09 00:27:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 161 states have (on average 1.7329192546583851) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2025-03-09 00:27:03,061 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 21 [2025-03-09 00:27:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:03,061 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2025-03-09 00:27:03,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2025-03-09 00:27:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:27:03,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:03,062 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:03,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:27:03,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:03,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:27:03,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1247705641, now seen corresponding path program 2 times [2025-03-09 00:27:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:27:03,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867900452] [2025-03-09 00:27:03,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:03,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:03,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:03,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:27:03,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:27:03,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-03-09 00:27:03,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:03,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:27:03,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:03,955 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2025-03-09 00:27:03,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-03-09 00:27:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-09 00:27:03,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:27:03,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:27:03,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867900452] [2025-03-09 00:27:03,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867900452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:03,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:03,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:03,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780865389] [2025-03-09 00:27:03,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:03,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:27:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:03,968 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:04,288 INFO L93 Difference]: Finished difference Result 263 states and 295 transitions. [2025-03-09 00:27:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:04,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 36 [2025-03-09 00:27:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:04,289 INFO L225 Difference]: With dead ends: 263 [2025-03-09 00:27:04,289 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 00:27:04,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:04,290 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 218 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:04,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 201 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:27:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 00:27:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 247. [2025-03-09 00:27:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 161 states have (on average 1.7018633540372672) internal successors, (274), 243 states have internal predecessors, (274), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 278 transitions. [2025-03-09 00:27:04,300 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 278 transitions. Word has length 36 [2025-03-09 00:27:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:04,302 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 278 transitions. [2025-03-09 00:27:04,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 278 transitions. [2025-03-09 00:27:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:27:04,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:04,303 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:04,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:27:04,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:04,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:27:04,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1247705640, now seen corresponding path program 1 times [2025-03-09 00:27:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:27:04,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287949260] [2025-03-09 00:27:04,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:04,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:04,508 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:04,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:27:04,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 00:27:05,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:27:05,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:05,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:05,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 00:27:05,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:05,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:27:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:05,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:07,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:27:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287949260] [2025-03-09 00:27:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287949260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:07,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:27:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-09 00:27:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983501381] [2025-03-09 00:27:07,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:07,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:27:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:27:07,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:27:07,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-03-09 00:27:07,456 INFO L87 Difference]: Start difference. First operand 247 states and 278 transitions. Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:13,974 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2025-03-09 00:27:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 00:27:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-09 00:27:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:13,976 INFO L225 Difference]: With dead ends: 277 [2025-03-09 00:27:13,976 INFO L226 Difference]: Without dead ends: 277 [2025-03-09 00:27:13,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 00:27:13,978 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 61 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:13,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 2376 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-09 00:27:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-09 00:27:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-09 00:27:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 191 states have (on average 1.5968586387434556) internal successors, (305), 273 states have internal predecessors, (305), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 309 transitions. [2025-03-09 00:27:13,984 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 309 transitions. Word has length 36 [2025-03-09 00:27:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:13,984 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 309 transitions. [2025-03-09 00:27:13,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 309 transitions. [2025-03-09 00:27:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 00:27:13,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:13,985 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:14,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:27:14,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:14,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:27:14,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1652649912, now seen corresponding path program 2 times [2025-03-09 00:27:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:27:14,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154456426] [2025-03-09 00:27:14,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:14,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:14,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:14,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:27:14,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 00:27:14,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-09 00:27:14,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:14,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 00:27:14,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:14,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:14,907 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 16 treesize of output 10 [2025-03-09 00:27:14,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2025-03-09 00:27:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:14,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:27:14,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:27:14,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154456426] [2025-03-09 00:27:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154456426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:27:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99693399] [2025-03-09 00:27:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:14,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:27:14,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:14,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:14,939 INFO L87 Difference]: Start difference. First operand 277 states and 309 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:15,930 INFO L93 Difference]: Finished difference Result 439 states and 501 transitions. [2025-03-09 00:27:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:15,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 42 [2025-03-09 00:27:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:15,932 INFO L225 Difference]: With dead ends: 439 [2025-03-09 00:27:15,932 INFO L226 Difference]: Without dead ends: 439 [2025-03-09 00:27:15,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:15,933 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 409 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:15,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 797 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 00:27:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-09 00:27:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 276. [2025-03-09 00:27:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 191 states have (on average 1.5916230366492146) internal successors, (304), 272 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 308 transitions. [2025-03-09 00:27:15,939 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 308 transitions. Word has length 42 [2025-03-09 00:27:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:15,939 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 308 transitions. [2025-03-09 00:27:15,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 308 transitions. [2025-03-09 00:27:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:27:15,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:15,940 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:15,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:27:16,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:16,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:27:16,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash 883633762, now seen corresponding path program 1 times [2025-03-09 00:27:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:27:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463938526] [2025-03-09 00:27:16,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:16,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:16,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:16,143 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:16,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:27:16,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:27:16,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:27:16,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:16,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 00:27:16,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:16,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:16,881 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 16 treesize of output 10 [2025-03-09 00:27:16,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2025-03-09 00:27:17,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:17,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 14 [2025-03-09 00:27:17,019 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:27:17,019 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 13 treesize of output 13 [2025-03-09 00:27:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:17,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:27:17,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:27:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463938526] [2025-03-09 00:27:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463938526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 00:27:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917921594] [2025-03-09 00:27:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:27:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:27:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:27:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:27:17,125 INFO L87 Difference]: Start difference. First operand 276 states and 308 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:19,183 INFO L93 Difference]: Finished difference Result 305 states and 340 transitions. [2025-03-09 00:27:19,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:27:19,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 45 [2025-03-09 00:27:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:19,185 INFO L225 Difference]: With dead ends: 305 [2025-03-09 00:27:19,185 INFO L226 Difference]: Without dead ends: 305 [2025-03-09 00:27:19,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:27:19,186 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 475 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:19,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 557 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:27:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-09 00:27:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2025-03-09 00:27:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 205 states have (on average 1.5853658536585367) internal successors, (325), 286 states have internal predecessors, (325), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:27:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 329 transitions. [2025-03-09 00:27:19,191 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 329 transitions. Word has length 45 [2025-03-09 00:27:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:19,192 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 329 transitions. [2025-03-09 00:27:19,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 329 transitions. [2025-03-09 00:27:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:27:19,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:19,192 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:19,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:27:19,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:19,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-03-09 00:27:19,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash 479060947, now seen corresponding path program 1 times [2025-03-09 00:27:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:27:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063152357] [2025-03-09 00:27:19,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:19,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:19,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:19,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:27:19,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:27:20,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:27:20,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:20,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:20,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 00:27:20,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:20,181 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 16 treesize of output 10 [2025-03-09 00:27:20,199 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 11 treesize of output 7 [2025-03-09 00:27:20,211 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 11 treesize of output 10 [2025-03-09 00:27:20,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:20,225 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 6 treesize of output 1 [2025-03-09 00:27:20,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:20,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 14 [2025-03-09 00:27:20,371 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:27:20,371 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 13 treesize of output 13 [2025-03-09 00:27:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:20,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:27:20,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:27:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063152357] [2025-03-09 00:27:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063152357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:20,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:27:20,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979637740] [2025-03-09 00:27:20,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:20,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:27:20,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:27:20,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:27:20,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:27:20,505 INFO L87 Difference]: Start difference. First operand 290 states and 329 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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)