./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/logname-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/logname-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 c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:27:27,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:27:27,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:27:27,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:27:27,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:27:27,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:27:27,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:27:27,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:27:27,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:27:27,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:27:27,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:27:27,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:27:27,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:27:27,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:27:27,875 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:27:27,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:27:27,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:27:27,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:27:27,876 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:27:27,876 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:27:27,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:27:27,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:27:27,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:27:27,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:27:27,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:27:27,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:27:27,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:27:27,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:27:27,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:27:27,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:27:27,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:27:27,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:27:27,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:27:27,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:27:27,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:27:27,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:27:27,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:27:27,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:27:27,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:27:27,879 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 -> c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af [2025-03-09 00:27:28,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:27:28,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:27:28,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:27:28,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:27:28,146 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:27:28,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-09 00:27:29,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ff86561/d6877c6e8a204b22806687bca17a4f1e/FLAG48c06aa4c [2025-03-09 00:27:29,684 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:27:29,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-03-09 00:27:29,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ff86561/d6877c6e8a204b22806687bca17a4f1e/FLAG48c06aa4c [2025-03-09 00:27:29,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ff86561/d6877c6e8a204b22806687bca17a4f1e [2025-03-09 00:27:29,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:27:29,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:27:29,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:27:29,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:27:29,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:27:29,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da30404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29, skipping insertion in model container [2025-03-09 00:27:29,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:27:30,587 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:27:30,590 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:27:30,592 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:27:30,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:27:30,598 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:27:30,598 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:27:30,599 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:27:30,599 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:27:30,600 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:27:30,603 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:27:30,604 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:27:30,608 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:27:30,608 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:27:30,613 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:27:30,624 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:27:30,633 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:27:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:27:30,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:27:30,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:27:30,882 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 00:27:30,889 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:27:30,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30 WrapperNode [2025-03-09 00:27:30,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:27:30,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:27:30,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:27:30,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:27:30,898 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:27:30" (1/1) ... [2025-03-09 00:27:30,925 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:27:30" (1/1) ... [2025-03-09 00:27:31,000 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 799 [2025-03-09 00:27:31,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:27:31,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:27:31,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:27:31,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:27:31,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,051 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 00:27:31,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:27:31,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:27:31,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:27:31,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:27:31,139 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (1/1) ... [2025-03-09 00:27:31,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:27:31,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:31,176 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:27:31,178 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:27:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:27:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 00:27:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 00:27:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 00:27:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:27:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:27:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 00:27:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:27:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:27:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 00:27:31,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 00:27:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 00:27:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 00:27:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:27:31,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:27:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:27:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 00:27:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-03-09 00:27:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-03-09 00:27:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 00:27:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 00:27:31,498 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:27:31,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:27:32,365 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-03-09 00:27:32,365 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-03-09 00:27:32,451 INFO L? ?]: Removed 349 outVars from TransFormulas that were not future-live. [2025-03-09 00:27:32,451 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:27:32,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:27:32,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:27:32,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:27:32 BoogieIcfgContainer [2025-03-09 00:27:32,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:27:32,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:27:32,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:27:32,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:27:32,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:27:29" (1/3) ... [2025-03-09 00:27:32,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11731552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:27:32, skipping insertion in model container [2025-03-09 00:27:32,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:30" (2/3) ... [2025-03-09 00:27:32,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11731552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:27:32, skipping insertion in model container [2025-03-09 00:27:32,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:27:32" (3/3) ... [2025-03-09 00:27:32,489 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2025-03-09 00:27:32,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:27:32,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 305 locations, 1 initial locations, 12 loop locations, and 119 error locations. [2025-03-09 00:27:32,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:27:32,554 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;@6fd74744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:27:32,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2025-03-09 00:27:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 172 states have (on average 1.8953488372093024) internal successors, (326), 291 states have internal predecessors, (326), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 00:27:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:27:32,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:32,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:27:32,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:32,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash 386244, now seen corresponding path program 1 times [2025-03-09 00:27:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:32,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129108092] [2025-03-09 00:27:32,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:32,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:27:32,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:27:32,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:32,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:33,177 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:27:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129108092] [2025-03-09 00:27:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129108092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143926797] [2025-03-09 00:27:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:33,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:33,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:33,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:33,210 INFO L87 Difference]: Start difference. First operand has 305 states, 172 states have (on average 1.8953488372093024) internal successors, (326), 291 states have internal predecessors, (326), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:33,353 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-03-09 00:27:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:33,357 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:27:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:33,362 INFO L225 Difference]: With dead ends: 109 [2025-03-09 00:27:33,362 INFO L226 Difference]: Without dead ends: 109 [2025-03-09 00:27:33,365 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:27:33,368 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 90 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:33,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 85 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-09 00:27:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-09 00:27:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 102 states have internal predecessors, (111), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-03-09 00:27:33,409 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 3 [2025-03-09 00:27:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:33,409 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-03-09 00:27:33,409 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:27:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-03-09 00:27:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:27:33,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:33,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:27:33,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:27:33,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:33,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 386245, now seen corresponding path program 1 times [2025-03-09 00:27:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:33,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055548311] [2025-03-09 00:27:33,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:33,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:27:33,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:27:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:33,776 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:27:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055548311] [2025-03-09 00:27:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055548311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:33,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:33,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:33,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815784494] [2025-03-09 00:27:33,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:33,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:33,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:33,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:33,778 INFO L87 Difference]: Start difference. First operand 109 states and 120 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:27:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:33,893 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2025-03-09 00:27:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:33,894 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:27:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:33,895 INFO L225 Difference]: With dead ends: 108 [2025-03-09 00:27:33,896 INFO L226 Difference]: Without dead ends: 108 [2025-03-09 00:27:33,896 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:27:33,897 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:33,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 180 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-09 00:27:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-09 00:27:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 101 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-03-09 00:27:33,909 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 3 [2025-03-09 00:27:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:33,910 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-03-09 00:27:33,910 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:27:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-03-09 00:27:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:27:33,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:33,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:27:33,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:27:33,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:33,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1377985186, now seen corresponding path program 1 times [2025-03-09 00:27:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466963127] [2025-03-09 00:27:33,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:33,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:33,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:27:33,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:27:33,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:33,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:34,283 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:27:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466963127] [2025-03-09 00:27:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466963127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:34,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:34,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591485823] [2025-03-09 00:27:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:34,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:27:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:34,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:27:34,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:27:34,285 INFO L87 Difference]: Start difference. First operand 108 states and 119 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:27:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:34,404 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2025-03-09 00:27:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:27:34,406 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:27:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:34,406 INFO L225 Difference]: With dead ends: 111 [2025-03-09 00:27:34,406 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 00:27:34,407 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:27:34,407 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:34,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 180 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 00:27:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-09 00:27:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.671641791044776) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2025-03-09 00:27:34,416 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 6 [2025-03-09 00:27:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:34,416 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2025-03-09 00:27:34,416 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:27:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2025-03-09 00:27:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:27:34,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:34,417 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:27:34,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:34,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash -258973856, now seen corresponding path program 1 times [2025-03-09 00:27:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:34,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590056891] [2025-03-09 00:27:34,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:34,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:27:34,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:27:34,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:34,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:34,817 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:27:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590056891] [2025-03-09 00:27:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590056891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318524112] [2025-03-09 00:27:34,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:34,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:34,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:34,823 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:27:34,825 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:27:34,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:27:35,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:27:35,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:35,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:35,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:27:35,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:35,163 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:27:35,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:35,272 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:27:35,285 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:27:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318524112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:35,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:35,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:27:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935472908] [2025-03-09 00:27:35,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:35,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:27:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:35,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:27:35,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:27:35,288 INFO L87 Difference]: Start difference. First operand 110 states and 121 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:27:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:35,546 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2025-03-09 00:27:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:27:35,546 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:27:35,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:35,547 INFO L225 Difference]: With dead ends: 114 [2025-03-09 00:27:35,547 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 00:27:35,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:27:35,548 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 200 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:35,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 393 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 00:27:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-09 00:27:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 107 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2025-03-09 00:27:35,555 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 9 [2025-03-09 00:27:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:35,555 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2025-03-09 00:27:35,555 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:27:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2025-03-09 00:27:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 00:27:35,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:35,555 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:35,568 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:27:35,756 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:27:35,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:35,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2001404417, now seen corresponding path program 1 times [2025-03-09 00:27:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:35,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530625598] [2025-03-09 00:27:35,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:35,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:27:35,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:27:35,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:35,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:36,031 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:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530625598] [2025-03-09 00:27:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530625598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164260819] [2025-03-09 00:27:36,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:36,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:36,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:36,034 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:27:36,036 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:27:36,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:27:36,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:27:36,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:36,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:36,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:27:36,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:36,289 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:36,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:36,331 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:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164260819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:36,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 00:27:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976148093] [2025-03-09 00:27:36,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:27:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:36,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:27:36,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:36,333 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:36,379 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2025-03-09 00:27:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:27:36,380 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 15 [2025-03-09 00:27:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:36,381 INFO L225 Difference]: With dead ends: 129 [2025-03-09 00:27:36,381 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 00:27:36,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:36,383 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:36,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 339 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 00:27:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-09 00:27:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 122 states have internal predecessors, (131), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-03-09 00:27:36,390 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2025-03-09 00:27:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:36,390 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-03-09 00:27:36,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-03-09 00:27:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:27:36,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:36,391 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:36,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:27:36,595 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:27:36,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:36,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1462427581, now seen corresponding path program 2 times [2025-03-09 00:27:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105824772] [2025-03-09 00:27:36,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:36,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 00:27:36,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-03-09 00:27:36,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:36,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:36,897 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:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105824772] [2025-03-09 00:27:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105824772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:27:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535015111] [2025-03-09 00:27:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:36,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:36,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:36,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:36,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:36,899 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:36,970 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2025-03-09 00:27:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:36,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 00:27:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:36,971 INFO L225 Difference]: With dead ends: 128 [2025-03-09 00:27:36,972 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 00:27:36,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:27:36,972 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 103 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:36,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:36,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 00:27:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-09 00:27:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 121 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-03-09 00:27:36,978 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 30 [2025-03-09 00:27:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:36,978 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-03-09 00:27:36,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-03-09 00:27:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:27:36,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:36,979 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:36,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:27:36,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:36,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1462427582, now seen corresponding path program 1 times [2025-03-09 00:27:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62236957] [2025-03-09 00:27:36,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:37,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:27:37,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:27:37,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:37,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:37,335 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:37,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62236957] [2025-03-09 00:27:37,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62236957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430108537] [2025-03-09 00:27:37,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:37,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:37,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:37,339 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:27:37,342 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:27:37,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:27:37,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:27:37,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:37,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:27:37,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:37,669 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:37,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:37,762 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:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430108537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:37,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:37,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-09 00:27:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774464559] [2025-03-09 00:27:37,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:37,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:27:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:37,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:27:37,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:37,764 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:37,812 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2025-03-09 00:27:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:37,813 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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 30 [2025-03-09 00:27:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:37,813 INFO L225 Difference]: With dead ends: 134 [2025-03-09 00:27:37,813 INFO L226 Difference]: Without dead ends: 134 [2025-03-09 00:27:37,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:37,814 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:37,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 669 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-09 00:27:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-09 00:27:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 127 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2025-03-09 00:27:37,826 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2025-03-09 00:27:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:37,827 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2025-03-09 00:27:37,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2025-03-09 00:27:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:27:37,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:37,827 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:37,838 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:27:38,028 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:27:38,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:38,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1377941378, now seen corresponding path program 2 times [2025-03-09 00:27:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120142862] [2025-03-09 00:27:38,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:38,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:27:38,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-09 00:27:38,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:38,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:38,306 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:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:38,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120142862] [2025-03-09 00:27:38,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120142862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:38,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:38,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87001317] [2025-03-09 00:27:38,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:38,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:27:38,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:38,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:27:38,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:27:38,308 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:38,432 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2025-03-09 00:27:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:27:38,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-09 00:27:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:38,433 INFO L225 Difference]: With dead ends: 133 [2025-03-09 00:27:38,433 INFO L226 Difference]: Without dead ends: 133 [2025-03-09 00:27:38,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:38,434 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 186 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:38,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 64 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-09 00:27:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-09 00:27:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 126 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2025-03-09 00:27:38,444 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 36 [2025-03-09 00:27:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:38,444 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2025-03-09 00:27:38,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2025-03-09 00:27:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:27:38,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:38,445 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:38,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:27:38,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:38,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -201725200, now seen corresponding path program 1 times [2025-03-09 00:27:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179872324] [2025-03-09 00:27:38,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:38,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:27:38,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:27:38,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:38,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:38,809 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:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179872324] [2025-03-09 00:27:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179872324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:38,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327938832] [2025-03-09 00:27:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:38,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:38,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:38,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:38,813 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:38,895 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2025-03-09 00:27:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:38,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 44 [2025-03-09 00:27:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:38,896 INFO L225 Difference]: With dead ends: 128 [2025-03-09 00:27:38,896 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 00:27:38,897 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:27:38,898 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 70 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:38,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 91 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 00:27:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-09 00:27:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 121 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-03-09 00:27:38,903 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 44 [2025-03-09 00:27:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:38,906 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-03-09 00:27:38,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-03-09 00:27:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:27:38,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:38,909 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:38,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:27:38,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:38,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:38,909 INFO L85 PathProgramCache]: Analyzing trace with hash -201725199, now seen corresponding path program 1 times [2025-03-09 00:27:38,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:38,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910297689] [2025-03-09 00:27:38,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:38,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:38,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:27:39,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:27:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:39,567 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:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910297689] [2025-03-09 00:27:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910297689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:39,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:39,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:27:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405604841] [2025-03-09 00:27:39,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:39,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:39,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:39,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:39,569 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:39,663 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2025-03-09 00:27:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:39,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 44 [2025-03-09 00:27:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:39,664 INFO L225 Difference]: With dead ends: 128 [2025-03-09 00:27:39,664 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 00:27:39,665 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:27:39,665 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 89 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 359 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:27:39,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 359 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 00:27:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-09 00:27:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 120 states have internal predecessors, (129), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2025-03-09 00:27:39,671 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 44 [2025-03-09 00:27:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:39,672 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2025-03-09 00:27:39,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2025-03-09 00:27:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:27:39,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:39,675 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] [2025-03-09 00:27:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:27:39,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -935880286, now seen corresponding path program 1 times [2025-03-09 00:27:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:39,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504895961] [2025-03-09 00:27:39,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:39,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:27:39,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:27:39,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:39,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:40,061 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:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504895961] [2025-03-09 00:27:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504895961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:40,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:27:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614699008] [2025-03-09 00:27:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:40,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:40,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:40,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:40,063 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:40,242 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2025-03-09 00:27:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:40,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 47 [2025-03-09 00:27:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:40,244 INFO L225 Difference]: With dead ends: 146 [2025-03-09 00:27:40,244 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 00:27:40,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:40,244 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 130 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:40,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 170 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 00:27:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2025-03-09 00:27:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 107 states have (on average 1.411214953271028) internal successors, (151), 134 states have internal predecessors, (151), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2025-03-09 00:27:40,250 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 47 [2025-03-09 00:27:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:40,250 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2025-03-09 00:27:40,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2025-03-09 00:27:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:27:40,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:40,251 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] [2025-03-09 00:27:40,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:27:40,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:40,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash -935881215, now seen corresponding path program 1 times [2025-03-09 00:27:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420889583] [2025-03-09 00:27:40,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:40,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:27:40,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:27:40,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:40,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:40,511 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:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420889583] [2025-03-09 00:27:40,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420889583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:40,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:40,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:40,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753963474] [2025-03-09 00:27:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:40,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:27:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:40,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:27:40,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:27:40,513 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:40,619 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2025-03-09 00:27:40,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:27:40,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 47 [2025-03-09 00:27:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:40,620 INFO L225 Difference]: With dead ends: 140 [2025-03-09 00:27:40,620 INFO L226 Difference]: Without dead ends: 140 [2025-03-09 00:27:40,620 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:27:40,621 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 67 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:40,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 150 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-09 00:27:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-09 00:27:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 133 states have internal predecessors, (150), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2025-03-09 00:27:40,624 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 47 [2025-03-09 00:27:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:40,624 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2025-03-09 00:27:40,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2025-03-09 00:27:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:27:40,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:40,625 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] [2025-03-09 00:27:40,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:27:40,625 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:40,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -935881214, now seen corresponding path program 1 times [2025-03-09 00:27:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:40,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363706581] [2025-03-09 00:27:40,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:40,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:27:40,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:27:40,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:40,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:40,895 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:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363706581] [2025-03-09 00:27:40,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363706581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:40,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:40,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:27:40,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377856106] [2025-03-09 00:27:40,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:40,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:40,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:40,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:40,899 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:40,967 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2025-03-09 00:27:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 47 [2025-03-09 00:27:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:40,968 INFO L225 Difference]: With dead ends: 145 [2025-03-09 00:27:40,970 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 00:27:40,971 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:27:40,971 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 122 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 354 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:40,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 354 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 00:27:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2025-03-09 00:27:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 133 states have internal predecessors, (149), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2025-03-09 00:27:40,977 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 47 [2025-03-09 00:27:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:40,979 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2025-03-09 00:27:40,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2025-03-09 00:27:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:27:40,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:40,979 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] [2025-03-09 00:27:40,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:27:40,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2118356395, now seen corresponding path program 1 times [2025-03-09 00:27:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47287039] [2025-03-09 00:27:40,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:41,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:27:41,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:27:41,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:41,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:41,211 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:41,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:41,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47287039] [2025-03-09 00:27:41,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47287039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:41,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:41,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899356638] [2025-03-09 00:27:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:41,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:41,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:41,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:41,213 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:41,270 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2025-03-09 00:27:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:41,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2025-03-09 00:27:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:41,271 INFO L225 Difference]: With dead ends: 139 [2025-03-09 00:27:41,271 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 00:27:41,272 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:27:41,272 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 66 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:41,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 00:27:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-09 00:27:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 132 states have internal predecessors, (147), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2025-03-09 00:27:41,275 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 50 [2025-03-09 00:27:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:41,276 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2025-03-09 00:27:41,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2025-03-09 00:27:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:27:41,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:41,276 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] [2025-03-09 00:27:41,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:27:41,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:41,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2118356396, now seen corresponding path program 1 times [2025-03-09 00:27:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795246415] [2025-03-09 00:27:41,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:41,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:27:41,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:27:41,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:41,905 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:41,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:41,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795246415] [2025-03-09 00:27:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795246415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:41,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:41,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:27:41,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845438824] [2025-03-09 00:27:41,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:41,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:27:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:41,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:27:41,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:27:41,908 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:42,143 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2025-03-09 00:27:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:42,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 50 [2025-03-09 00:27:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:42,145 INFO L225 Difference]: With dead ends: 143 [2025-03-09 00:27:42,145 INFO L226 Difference]: Without dead ends: 143 [2025-03-09 00:27:42,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:27:42,145 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 200 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:42,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 222 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-09 00:27:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2025-03-09 00:27:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 132 states have internal predecessors, (146), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2025-03-09 00:27:42,149 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 50 [2025-03-09 00:27:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:42,149 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2025-03-09 00:27:42,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2025-03-09 00:27:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:27:42,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:42,150 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] [2025-03-09 00:27:42,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:27:42,150 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:42,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2001177146, now seen corresponding path program 1 times [2025-03-09 00:27:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97637537] [2025-03-09 00:27:42,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:42,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:27:42,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:27:42,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:42,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:42,620 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:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97637537] [2025-03-09 00:27:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97637537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:42,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:27:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234060067] [2025-03-09 00:27:42,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:42,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:27:42,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:42,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:27:42,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:42,621 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:42,780 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2025-03-09 00:27:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:42,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-09 00:27:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:42,781 INFO L225 Difference]: With dead ends: 138 [2025-03-09 00:27:42,781 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 00:27:42,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:27:42,782 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 76 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:42,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 299 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 00:27:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-09 00:27:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 131 states have internal predecessors, (144), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2025-03-09 00:27:42,785 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 53 [2025-03-09 00:27:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:42,785 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2025-03-09 00:27:42,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2025-03-09 00:27:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:27:42,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:42,786 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] [2025-03-09 00:27:42,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:27:42,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:42,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2001177147, now seen corresponding path program 1 times [2025-03-09 00:27:42,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932554635] [2025-03-09 00:27:42,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:27:42,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:27:42,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:42,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:43,406 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:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932554635] [2025-03-09 00:27:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932554635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:43,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:27:43,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888624604] [2025-03-09 00:27:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:43,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:27:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:43,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:27:43,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:43,408 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:43,559 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2025-03-09 00:27:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:43,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-09 00:27:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:43,561 INFO L225 Difference]: With dead ends: 137 [2025-03-09 00:27:43,561 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 00:27:43,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:27:43,561 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 73 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:43,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 302 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 00:27:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-09 00:27:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 130 states have internal predecessors, (142), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2025-03-09 00:27:43,565 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 53 [2025-03-09 00:27:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:43,565 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2025-03-09 00:27:43,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2025-03-09 00:27:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 00:27:43,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:43,566 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] [2025-03-09 00:27:43,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:27:43,566 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:43,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 405502510, now seen corresponding path program 1 times [2025-03-09 00:27:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:43,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688712785] [2025-03-09 00:27:43,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:43,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 00:27:43,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 00:27:43,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:43,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:43,689 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:27:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:43,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688712785] [2025-03-09 00:27:43,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688712785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:43,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:43,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629497872] [2025-03-09 00:27:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:43,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:43,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:43,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:43,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:43,691 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:43,704 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2025-03-09 00:27:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 57 [2025-03-09 00:27:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:43,706 INFO L225 Difference]: With dead ends: 149 [2025-03-09 00:27:43,706 INFO L226 Difference]: Without dead ends: 149 [2025-03-09 00:27:43,706 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:27:43,707 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 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:27:43,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-09 00:27:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2025-03-09 00:27:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 132 states have internal predecessors, (144), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-03-09 00:27:43,718 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 57 [2025-03-09 00:27:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:43,718 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-03-09 00:27:43,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2025-03-09 00:27:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:27:43,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:43,719 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, 1, 1] [2025-03-09 00:27:43,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:27:43,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash -314077471, now seen corresponding path program 1 times [2025-03-09 00:27:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250979584] [2025-03-09 00:27:43,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:43,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:27:43,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:27:43,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:43,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:44,214 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:44,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250979584] [2025-03-09 00:27:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250979584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:27:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888155422] [2025-03-09 00:27:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:44,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:27:44,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:44,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:27:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:27:44,216 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:44,431 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2025-03-09 00:27:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:27:44,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 58 [2025-03-09 00:27:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:44,432 INFO L225 Difference]: With dead ends: 146 [2025-03-09 00:27:44,432 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 00:27:44,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:27:44,433 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 89 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:44,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 352 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 00:27:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-03-09 00:27:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 138 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 162 transitions. [2025-03-09 00:27:44,436 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 162 transitions. Word has length 58 [2025-03-09 00:27:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:44,437 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 162 transitions. [2025-03-09 00:27:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2025-03-09 00:27:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:27:44,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:44,437 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, 1, 1] [2025-03-09 00:27:44,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:27:44,437 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash -314077470, now seen corresponding path program 1 times [2025-03-09 00:27:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654520514] [2025-03-09 00:27:44,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:44,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:27:44,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:27:44,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:44,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:45,303 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:45,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654520514] [2025-03-09 00:27:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654520514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:45,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:45,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:27:45,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343996567] [2025-03-09 00:27:45,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:45,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:27:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:45,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:27:45,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:45,305 INFO L87 Difference]: Start difference. First operand 145 states and 162 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:45,620 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2025-03-09 00:27:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:27:45,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 58 [2025-03-09 00:27:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:45,621 INFO L225 Difference]: With dead ends: 145 [2025-03-09 00:27:45,621 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 00:27:45,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:27:45,622 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 154 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:45,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 394 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 00:27:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-09 00:27:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 138 states have internal predecessors, (151), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2025-03-09 00:27:45,629 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 58 [2025-03-09 00:27:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:45,629 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2025-03-09 00:27:45,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2025-03-09 00:27:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 00:27:45,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:45,630 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, 1, 1] [2025-03-09 00:27:45,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:27:45,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:45,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -810107906, now seen corresponding path program 1 times [2025-03-09 00:27:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938427592] [2025-03-09 00:27:45,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:45,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:27:45,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:27:45,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:45,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:45,765 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:27:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938427592] [2025-03-09 00:27:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938427592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832386508] [2025-03-09 00:27:45,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:45,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:45,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:45,768 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:27:45,770 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:27:45,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:27:46,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:27:46,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:46,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:46,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:27:46,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:46,091 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:27:46,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:46,119 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:27:46,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832386508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:46,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:46,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:27:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250719891] [2025-03-09 00:27:46,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:46,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:27:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:46,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:27:46,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:46,122 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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:27:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:46,145 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2025-03-09 00:27:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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 62 [2025-03-09 00:27:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:46,148 INFO L225 Difference]: With dead ends: 174 [2025-03-09 00:27:46,148 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 00:27:46,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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:27:46,148 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 18 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:46,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 308 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 00:27:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2025-03-09 00:27:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 139 states have (on average 1.330935251798561) internal successors, (185), 162 states have internal predecessors, (185), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2025-03-09 00:27:46,154 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 62 [2025-03-09 00:27:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:46,154 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2025-03-09 00:27:46,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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:27:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2025-03-09 00:27:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:27:46,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:46,155 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, 1, 1] [2025-03-09 00:27:46,165 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:46,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:46,356 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:46,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash 656705297, now seen corresponding path program 1 times [2025-03-09 00:27:46,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:46,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145118171] [2025-03-09 00:27:46,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:46,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:27:46,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:27:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:46,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:46,998 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:27:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145118171] [2025-03-09 00:27:46,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145118171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714280448] [2025-03-09 00:27:46,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:47,000 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:47,002 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:47,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:27:47,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:27:47,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:47,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:47,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 00:27:47,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:47,336 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:47,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:47,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:27:47,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:27:47,418 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 21 treesize of output 16 [2025-03-09 00:27:47,461 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:27:47,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-09 00:27:47,504 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:27:47,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-09 00:27:47,520 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 37 treesize of output 13 [2025-03-09 00:27:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 00:27:47,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:47,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2615 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2615) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-03-09 00:27:47,627 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-09 00:27:47,627 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 37 treesize of output 36 [2025-03-09 00:27:47,636 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2615 (Array Int Int)) (v_ArrVal_2614 (Array Int Int))) (= (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2614))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2615)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem164#1.base|)) is different from false [2025-03-09 00:27:51,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:27:51,790 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 80 [2025-03-09 00:27:51,796 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 3389 treesize of output 2301 [2025-03-09 00:27:51,815 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 144 treesize of output 102 [2025-03-09 00:27:51,824 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 48 treesize of output 30 [2025-03-09 00:27:51,828 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 84 treesize of output 66 [2025-03-09 00:27:51,929 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 00:27:51,929 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 12 [2025-03-09 00:27:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2025-03-09 00:27:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714280448] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:51,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:51,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-03-09 00:27:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750300162] [2025-03-09 00:27:51,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:51,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:27:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:51,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:27:51,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=294, Unknown=15, NotChecked=74, Total=462 [2025-03-09 00:27:51,943 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 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:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:52,579 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2025-03-09 00:27:52,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:27:52,580 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 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 63 [2025-03-09 00:27:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:52,581 INFO L225 Difference]: With dead ends: 168 [2025-03-09 00:27:52,581 INFO L226 Difference]: Without dead ends: 168 [2025-03-09 00:27:52,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=132, Invalid=413, Unknown=15, NotChecked=90, Total=650 [2025-03-09 00:27:52,582 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 190 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:52,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 714 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 503 Invalid, 0 Unknown, 178 Unchecked, 0.5s Time] [2025-03-09 00:27:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-09 00:27:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-09 00:27:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 161 states have internal predecessors, (179), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:27:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2025-03-09 00:27:52,590 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 63 [2025-03-09 00:27:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:52,591 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2025-03-09 00:27:52,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 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:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2025-03-09 00:27:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:27:52,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:52,592 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, 1, 1] [2025-03-09 00:27:52,604 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:27:52,792 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,SelfDestructingSolverStorable21 [2025-03-09 00:27:52,793 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:27:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 656705298, now seen corresponding path program 1 times [2025-03-09 00:27:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127069093] [2025-03-09 00:27:52,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:52,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:27:52,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:27:52,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:52,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:54,021 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:27:54,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:54,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127069093] [2025-03-09 00:27:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127069093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:54,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055788096] [2025-03-09 00:27:54,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:54,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:54,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:54,025 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:54,028 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:54,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:27:54,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:27:54,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:54,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:54,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 00:27:54,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:54,401 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:54,429 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:27:54,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:54,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:27:54,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:27:54,488 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 15 treesize of output 11 [2025-03-09 00:27:54,558 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 34 treesize of output 27 [2025-03-09 00:27:54,571 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 20 treesize of output 15 [2025-03-09 00:27:54,656 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:27:54,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-09 00:27:54,663 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 36 treesize of output 15 [2025-03-09 00:27:54,789 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:27:54,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-09 00:27:54,800 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 36 treesize of output 15 [2025-03-09 00:27:54,866 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 37 treesize of output 13 [2025-03-09 00:27:54,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-09 00:27:54,901 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:27:54,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:55,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2899 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (<= (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:27:55,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2898))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2897) .cse1 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2897) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2898) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2025-03-09 00:27:55,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2895))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2898))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2896) .cse0 v_ArrVal_2897) .cse1 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2895))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2896) .cse5 v_ArrVal_2897) (select (select (store .cse6 .cse5 v_ArrVal_2898) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2899))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) is different from false [2025-03-09 00:27:55,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:27:55,398 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2025-03-09 00:27:55,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:27:55,409 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2025-03-09 00:27:55,430 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 140554 treesize of output 118898 [2025-03-09 00:27:56,336 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 72631 treesize of output 69935 [2025-03-09 00:27:56,740 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 14239 treesize of output 13231 [2025-03-09 00:27:56,794 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 13231 treesize of output 12559 [2025-03-09 00:27:56,848 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 12559 treesize of output 10231 [2025-03-09 00:27:56,901 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 10231 treesize of output 9559 [2025-03-09 00:27:56,955 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 9559 treesize of output 8005 [2025-03-09 00:27:57,032 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 8005 treesize of output 7669 [2025-03-09 00:28:33,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:28:33,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2025-03-09 00:28:33,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:28:33,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2025-03-09 00:28:33,367 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:28:33,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 61 [2025-03-09 00:28:33,375 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:28:33,375 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:28:33,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-03-09 00:28:33,476 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 00:28:33,476 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 12 [2025-03-09 00:28:33,484 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:28:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055788096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:33,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:28:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-03-09 00:28:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905098348] [2025-03-09 00:28:33,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 00:28:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:33,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 00:28:33,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=675, Unknown=26, NotChecked=168, Total=992 [2025-03-09 00:28:33,486 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 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:28:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:34,638 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2025-03-09 00:28:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:28:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 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 63 [2025-03-09 00:28:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:34,640 INFO L225 Difference]: With dead ends: 167 [2025-03-09 00:28:34,640 INFO L226 Difference]: Without dead ends: 167 [2025-03-09 00:28:34,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=1191, Unknown=26, NotChecked=228, Total=1722 [2025-03-09 00:28:34,641 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 131 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 24 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:34,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 874 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 817 Invalid, 6 Unknown, 297 Unchecked, 0.7s Time] [2025-03-09 00:28:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-09 00:28:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-09 00:28:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 160 states have internal predecessors, (173), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:28:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2025-03-09 00:28:34,645 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 63 [2025-03-09 00:28:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:34,645 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2025-03-09 00:28:34,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 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:28:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2025-03-09 00:28:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 00:28:34,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:34,646 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, 1, 1] [2025-03-09 00:28:34,655 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:28:34,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:34,847 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:28:34,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1494598098, now seen corresponding path program 2 times [2025-03-09 00:28:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:34,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794426681] [2025-03-09 00:28:34,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:28:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:34,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:28:34,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:28:34,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:28:34,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:35,124 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:28:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794426681] [2025-03-09 00:28:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794426681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806667055] [2025-03-09 00:28:35,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:28:35,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:35,127 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:28:35,129 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:28:35,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:28:35,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:28:35,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:28:35,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:35,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:28:35,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:35,597 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:28:35,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:35,660 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:28:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806667055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:35,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:28:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:28:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148087880] [2025-03-09 00:28:35,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:35,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:28:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:35,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:28:35,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:28:35,662 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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:28:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:35,719 INFO L93 Difference]: Finished difference Result 236 states and 248 transitions. [2025-03-09 00:28:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:28:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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 77 [2025-03-09 00:28:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:35,721 INFO L225 Difference]: With dead ends: 236 [2025-03-09 00:28:35,721 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 00:28:35,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:28:35,722 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 29 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:35,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 508 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:28:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 00:28:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2025-03-09 00:28:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 199 states have (on average 1.2010050251256281) internal successors, (239), 220 states have internal predecessors, (239), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:28:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 248 transitions. [2025-03-09 00:28:35,729 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 248 transitions. Word has length 77 [2025-03-09 00:28:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:35,729 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 248 transitions. [2025-03-09 00:28:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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:28:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 248 transitions. [2025-03-09 00:28:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 00:28:35,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:35,730 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, 1, 1] [2025-03-09 00:28:35,741 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:28:35,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:35,931 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:28:35,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash 514171950, now seen corresponding path program 3 times [2025-03-09 00:28:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:35,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665341617] [2025-03-09 00:28:35,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:28:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:35,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-03-09 00:28:36,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-03-09 00:28:36,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:28:36,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:36,420 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:28:36,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665341617] [2025-03-09 00:28:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665341617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213058727] [2025-03-09 00:28:36,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:28:36,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:36,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:36,424 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:28:36,426 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:28:36,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-03-09 00:28:36,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-03-09 00:28:36,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:28:36,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:36,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 00:28:36,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:36,800 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:28:36,873 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 00:28:36,873 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 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-09 00:28:36,890 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:28:36,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:28:36,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:28:36,987 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 21 treesize of output 16 [2025-03-09 00:28:37,034 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:28:37,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:37,590 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:28:37,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:28:37,598 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:28:37,624 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:28:37,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:38,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:28:38,774 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:28:38,967 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:28:38,991 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:28:38,991 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:28:39,041 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:28:39,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213058727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:39,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:28:39,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 22 [2025-03-09 00:28:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380400485] [2025-03-09 00:28:39,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:39,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 00:28:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:39,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 00:28:39,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:28:39,043 INFO L87 Difference]: Start difference. First operand 227 states and 248 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 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:28:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:39,639 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2025-03-09 00:28:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:28:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-03-09 00:28:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:39,640 INFO L225 Difference]: With dead ends: 224 [2025-03-09 00:28:39,640 INFO L226 Difference]: Without dead ends: 224 [2025-03-09 00:28:39,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=810, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 00:28:39,641 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 294 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:39,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 587 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:28:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-09 00:28:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 168. [2025-03-09 00:28:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 161 states have internal predecessors, (170), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:28:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2025-03-09 00:28:39,645 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 107 [2025-03-09 00:28:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:39,646 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2025-03-09 00:28:39,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 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:28:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2025-03-09 00:28:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 00:28:39,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:39,648 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] [2025-03-09 00:28:39,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 00:28:39,849 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,SelfDestructingSolverStorable24 [2025-03-09 00:28:39,849 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:28:39,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash 514171022, now seen corresponding path program 1 times [2025-03-09 00:28:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811970268] [2025-03-09 00:28:39,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:39,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 00:28:39,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 00:28:39,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:39,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:40,608 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:28:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811970268] [2025-03-09 00:28:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811970268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012263453] [2025-03-09 00:28:40,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:40,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:40,611 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:28:40,614 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:28:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 00:28:41,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 00:28:41,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:41,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:41,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 00:28:41,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:41,036 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:28:41,107 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 00:28:41,107 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 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-09 00:28:41,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:28:41,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:28:41,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:28:41,206 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 21 treesize of output 16 [2025-03-09 00:28:41,249 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:28:41,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:41,488 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 16 treesize of output 11 [2025-03-09 00:28:41,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:28:41,496 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:28:41,507 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:28:41,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:42,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:28:42,033 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 37 treesize of output 55 [2025-03-09 00:28:42,174 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:28:42,198 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:28:42,198 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:28:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:28:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012263453] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:42,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:28:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 9] total 22 [2025-03-09 00:28:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409245480] [2025-03-09 00:28:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:42,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:28:42,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:42,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:28:42,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:28:42,232 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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:28:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:42,795 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2025-03-09 00:28:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:28:42,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-03-09 00:28:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:42,797 INFO L225 Difference]: With dead ends: 167 [2025-03-09 00:28:42,797 INFO L226 Difference]: Without dead ends: 167 [2025-03-09 00:28:42,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2025-03-09 00:28:42,797 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 282 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:42,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 169 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:28:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-09 00:28:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-09 00:28:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.1736111111111112) internal successors, (169), 160 states have internal predecessors, (169), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:28:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2025-03-09 00:28:42,803 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 107 [2025-03-09 00:28:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:42,803 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2025-03-09 00:28:42,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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:28:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2025-03-09 00:28:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 00:28:42,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:42,804 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, 1, 1] [2025-03-09 00:28:42,816 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:28:43,009 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,SelfDestructingSolverStorable25 [2025-03-09 00:28:43,009 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:28:43,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1843455904, now seen corresponding path program 1 times [2025-03-09 00:28:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326631540] [2025-03-09 00:28:43,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 00:28:43,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 00:28:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:44,381 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:28:44,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:44,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326631540] [2025-03-09 00:28:44,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326631540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194867081] [2025-03-09 00:28:44,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:44,384 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:28:44,389 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:28:44,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 00:28:44,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 00:28:44,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:44,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:44,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:28:44,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:44,821 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:28:44,829 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:28:44,842 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-09 00:28:44,842 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:28:44,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:44,996 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-09 00:28:44,997 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:28:45,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:28:45,006 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:28:45,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:45,776 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:28:45,784 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:28:45,784 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:28:45,876 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:28:45,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:46,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:28:46,809 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:28:47,072 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:28:47,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194867081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:47,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:28:47,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2025-03-09 00:28:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231852845] [2025-03-09 00:28:47,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:47,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:28:47,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:47,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:28:47,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-03-09 00:28:47,074 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 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:28:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:48,144 INFO L93 Difference]: Finished difference Result 281 states and 295 transitions. [2025-03-09 00:28:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:28:48,145 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 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 110 [2025-03-09 00:28:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:48,146 INFO L225 Difference]: With dead ends: 281 [2025-03-09 00:28:48,146 INFO L226 Difference]: Without dead ends: 281 [2025-03-09 00:28:48,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 00:28:48,147 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 362 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:48,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 637 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:28:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-09 00:28:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 162. [2025-03-09 00:28:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.1714285714285715) internal successors, (164), 155 states have internal predecessors, (164), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:28:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2025-03-09 00:28:48,151 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 110 [2025-03-09 00:28:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:48,152 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2025-03-09 00:28:48,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 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:28:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2025-03-09 00:28:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-09 00:28:48,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:48,152 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] [2025-03-09 00:28:48,164 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:28:48,352 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,SelfDestructingSolverStorable26 [2025-03-09 00:28:48,353 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:28:48,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:48,353 INFO L85 PathProgramCache]: Analyzing trace with hash 454638247, now seen corresponding path program 1 times [2025-03-09 00:28:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:48,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116719988] [2025-03-09 00:28:48,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:48,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 00:28:48,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 00:28:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:48,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:28:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116719988] [2025-03-09 00:28:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116719988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:49,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:49,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:28:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604314059] [2025-03-09 00:28:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:49,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:28:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:49,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:28:49,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:28:49,269 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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:28:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:49,382 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2025-03-09 00:28:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:28:49,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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 111 [2025-03-09 00:28:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:49,383 INFO L225 Difference]: With dead ends: 159 [2025-03-09 00:28:49,383 INFO L226 Difference]: Without dead ends: 159 [2025-03-09 00:28:49,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:28:49,384 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 265 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:49,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 75 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:28:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-09 00:28:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-09 00:28:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.15) internal successors, (161), 152 states have internal predecessors, (161), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 00:28:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2025-03-09 00:28:49,386 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 111 [2025-03-09 00:28:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:49,386 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2025-03-09 00:28:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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:28:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2025-03-09 00:28:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-09 00:28:49,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:49,387 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] [2025-03-09 00:28:49,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 00:28:49,387 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-03-09 00:28:49,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash 454638248, now seen corresponding path program 1 times [2025-03-09 00:28:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151825501] [2025-03-09 00:28:49,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:49,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-09 00:28:49,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-09 00:28:49,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:49,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat