./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/mkfifo-incomplete-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 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:15:05,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:15:05,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:15:05,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:15:05,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:15:05,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:15:05,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:15:05,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:15:05,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:15:05,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:15:05,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:15:05,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:15:05,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:15:05,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:15:05,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:15:05,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:15:05,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:15:05,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:15:05,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:15:05,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:15:05,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:15:05,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:15:05,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:15:05,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:15:05,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:15:05,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:15:05,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:15:05,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:15:05,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:15:05,378 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 -> 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d [2025-03-04 09:15:05,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:15:05,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:15:05,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:15:05,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:15:05,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:15:05,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-03-04 09:15:06,761 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7ef5142/3517aaa052654a5bb62377c3f74639d0/FLAGdcb2042a6 [2025-03-04 09:15:07,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:15:07,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-03-04 09:15:07,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7ef5142/3517aaa052654a5bb62377c3f74639d0/FLAGdcb2042a6 [2025-03-04 09:15:07,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7ef5142/3517aaa052654a5bb62377c3f74639d0 [2025-03-04 09:15:07,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:15:07,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:15:07,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:15:07,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:15:07,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:15:07,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:15:07" (1/1) ... [2025-03-04 09:15:07,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb7904c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:07, skipping insertion in model container [2025-03-04 09:15:07,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:15:07" (1/1) ... [2025-03-04 09:15:07,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:15:07,992 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-04 09:15:07,996 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-04 09:15:07,997 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-04 09:15:07,998 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-04 09:15:07,998 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-04 09:15:08,001 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-04 09:15:08,004 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-04 09:15:08,004 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-04 09:15:08,005 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-04 09:15:08,007 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-04 09:15:08,008 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-04 09:15:08,011 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-04 09:15:08,012 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-04 09:15:08,017 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-04 09:15:08,018 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-04 09:15:08,021 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-04 09:15:08,029 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-04 09:15:08,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:15:08,064 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:15:08,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:15:08,263 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:15:08,268 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:15:08,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08 WrapperNode [2025-03-04 09:15:08,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:15:08,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:15:08,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:15:08,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:15:08,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,371 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 776 [2025-03-04 09:15:08,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:15:08,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:15:08,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:15:08,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:15:08,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,400 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 09:15:08,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:15:08,456 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:15:08,456 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:15:08,456 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:15:08,457 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (1/1) ... [2025-03-04 09:15:08,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:15:08,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:08,484 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-04 09:15:08,487 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-04 09:15:08,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:15:08,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:15:08,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 09:15:08,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:15:08,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:15:08,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 09:15:08,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 09:15:08,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 09:15:08,716 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:15:08,717 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:15:09,392 INFO L? ?]: Removed 361 outVars from TransFormulas that were not future-live. [2025-03-04 09:15:09,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:15:09,411 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:15:09,411 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:15:09,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:15:09 BoogieIcfgContainer [2025-03-04 09:15:09,411 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:15:09,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:15:09,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:15:09,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:15:09,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:15:07" (1/3) ... [2025-03-04 09:15:09,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d78fda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:15:09, skipping insertion in model container [2025-03-04 09:15:09,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:08" (2/3) ... [2025-03-04 09:15:09,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d78fda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:15:09, skipping insertion in model container [2025-03-04 09:15:09,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:15:09" (3/3) ... [2025-03-04 09:15:09,419 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-1.i [2025-03-04 09:15:09,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:15:09,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-1.i that has 3 procedures, 308 locations, 1 initial locations, 12 loop locations, and 125 error locations. [2025-03-04 09:15:09,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:15:09,469 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;@56a77063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:15:09,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-03-04 09:15:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 173 states have (on average 1.930635838150289) internal successors, (334), 298 states have internal predecessors, (334), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 09:15:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:15:09,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:09,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:15:09,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 393195, now seen corresponding path program 1 times [2025-03-04 09:15:09,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:09,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617223609] [2025-03-04 09:15:09,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:09,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:09,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:15:09,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:15:09,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:09,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:10,022 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-04 09:15:10,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:10,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617223609] [2025-03-04 09:15:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617223609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:10,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:10,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:15:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627885761] [2025-03-04 09:15:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:10,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:10,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:10,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:10,053 INFO L87 Difference]: Start difference. First operand has 308 states, 173 states have (on average 1.930635838150289) internal successors, (334), 298 states have internal predecessors, (334), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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-04 09:15:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:10,243 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2025-03-04 09:15:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:10,245 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-04 09:15:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:10,251 INFO L225 Difference]: With dead ends: 215 [2025-03-04 09:15:10,251 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 09:15:10,253 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-04 09:15:10,256 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 116 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:10,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 169 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:15:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 09:15:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2025-03-04 09:15:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 141 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:15:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2025-03-04 09:15:10,311 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 3 [2025-03-04 09:15:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:10,311 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2025-03-04 09:15:10,311 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-04 09:15:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2025-03-04 09:15:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:15:10,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:10,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:15:10,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:15:10,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash 393196, now seen corresponding path program 1 times [2025-03-04 09:15:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460605873] [2025-03-04 09:15:10,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:10,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:15:10,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:15:10,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:10,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:10,558 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-04 09:15:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460605873] [2025-03-04 09:15:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460605873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:15:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927241942] [2025-03-04 09:15:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:10,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:10,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:10,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:10,560 INFO L87 Difference]: Start difference. First operand 146 states and 158 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-04 09:15:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:10,644 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2025-03-04 09:15:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:10,644 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-04 09:15:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:10,645 INFO L225 Difference]: With dead ends: 145 [2025-03-04 09:15:10,645 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 09:15:10,645 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-04 09:15:10,646 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:10,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 243 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 09:15:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-04 09:15:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 140 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:15:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2025-03-04 09:15:10,651 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 3 [2025-03-04 09:15:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:10,652 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2025-03-04 09:15:10,652 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-04 09:15:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2025-03-04 09:15:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:15:10,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:10,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:15:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:15:10,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:10,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1170901155, now seen corresponding path program 1 times [2025-03-04 09:15:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103818344] [2025-03-04 09:15:10,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:15:10,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:15:10,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:10,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:10,792 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-04 09:15:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103818344] [2025-03-04 09:15:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103818344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:10,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:10,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949077942] [2025-03-04 09:15:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:10,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:10,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:10,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:10,793 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-04 09:15:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:10,809 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2025-03-04 09:15:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:10,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-04 09:15:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:10,814 INFO L225 Difference]: With dead ends: 148 [2025-03-04 09:15:10,814 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 09:15:10,814 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-04 09:15:10,815 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 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-04 09:15:10,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:15:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 09:15:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2025-03-04 09:15:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.7882352941176471) internal successors, (152), 141 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:15:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2025-03-04 09:15:10,825 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 6 [2025-03-04 09:15:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:10,825 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2025-03-04 09:15:10,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-04 09:15:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2025-03-04 09:15:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:15:10,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:10,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:15:10,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:15:10,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:10,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1170900994, now seen corresponding path program 1 times [2025-03-04 09:15:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964832028] [2025-03-04 09:15:10,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:10,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:15:10,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:15:10,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:10,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:11,061 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-04 09:15:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:11,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964832028] [2025-03-04 09:15:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964832028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:11,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:11,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:15:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760564690] [2025-03-04 09:15:11,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:11,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:15:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:11,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:15:11,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:15:11,063 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-04 09:15:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:11,201 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2025-03-04 09:15:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:15:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-04 09:15:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:11,202 INFO L225 Difference]: With dead ends: 147 [2025-03-04 09:15:11,202 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 09:15:11,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:15:11,203 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 138 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:11,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 342 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 09:15:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2025-03-04 09:15:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 86 states have (on average 1.7674418604651163) internal successors, (152), 141 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:15:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2025-03-04 09:15:11,211 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 6 [2025-03-04 09:15:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:11,211 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2025-03-04 09:15:11,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-04 09:15:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2025-03-04 09:15:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:15:11,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:11,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:11,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:15:11,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:11,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1413159750, now seen corresponding path program 1 times [2025-03-04 09:15:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13944129] [2025-03-04 09:15:11,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:11,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:11,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:11,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:11,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13944129] [2025-03-04 09:15:11,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13944129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:11,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317244289] [2025-03-04 09:15:11,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:11,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:11,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:11,347 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-04 09:15:11,349 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-04 09:15:11,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:11,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:11,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:11,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:11,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:15:11,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:11,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317244289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:15:11,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:15:11,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:15:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667883562] [2025-03-04 09:15:11,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:15:11,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:15:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:11,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:15:11,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:11,560 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-04 09:15:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:11,582 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2025-03-04 09:15:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-04 09:15:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:11,586 INFO L225 Difference]: With dead ends: 154 [2025-03-04 09:15:11,587 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 09:15:11,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-04 09:15:11,587 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 450 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-04 09:15:11,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 450 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:15:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 09:15:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 09:15:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 94 states have (on average 1.7234042553191489) internal successors, (162), 149 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:15:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-03-04 09:15:11,596 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 9 [2025-03-04 09:15:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:11,596 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-03-04 09:15:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-04 09:15:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-03-04 09:15:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:15:11,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:11,599 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:11,607 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-04 09:15:11,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:11,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:11,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1413159911, now seen corresponding path program 1 times [2025-03-04 09:15:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:11,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695465792] [2025-03-04 09:15:11,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:11,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:11,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:11,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:11,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:12,108 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-04 09:15:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:12,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695465792] [2025-03-04 09:15:12,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695465792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:12,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797769133] [2025-03-04 09:15:12,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:12,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:12,112 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-04 09:15:12,114 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-04 09:15:12,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:12,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:12,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:12,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:12,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:15:12,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:12,363 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-04 09:15:12,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:12,431 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-04 09:15:12,441 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-04 09:15:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797769133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:15:12,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:15:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:15:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628509800] [2025-03-04 09:15:12,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:15:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:15:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:15:12,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:15:12,442 INFO L87 Difference]: Start difference. First operand 154 states and 168 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-04 09:15:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:12,695 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2025-03-04 09:15:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:15:12,696 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-04 09:15:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:12,696 INFO L225 Difference]: With dead ends: 153 [2025-03-04 09:15:12,696 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 09:15:12,697 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-04 09:15:12,697 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 277 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:12,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 696 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:15:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 09:15:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-04 09:15:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 148 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:15:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2025-03-04 09:15:12,707 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 9 [2025-03-04 09:15:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2025-03-04 09:15:12,707 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-04 09:15:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2025-03-04 09:15:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:15:12,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:12,708 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:12,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:15:12,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 09:15:12,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash -6453731, now seen corresponding path program 2 times [2025-03-04 09:15:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901042290] [2025-03-04 09:15:12,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:15:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:12,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 09:15:12,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 09:15:12,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:15:12,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 09:15:13,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:13,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901042290] [2025-03-04 09:15:13,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901042290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:13,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:13,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:15:13,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026428748] [2025-03-04 09:15:13,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:13,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:15:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:13,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:15:13,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:13,110 INFO L87 Difference]: Start difference. First operand 153 states and 165 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-04 09:15:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:13,226 INFO L93 Difference]: Finished difference Result 223 states and 242 transitions. [2025-03-04 09:15:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:13,226 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 18 [2025-03-04 09:15:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:13,227 INFO L225 Difference]: With dead ends: 223 [2025-03-04 09:15:13,227 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 09:15:13,227 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-04 09:15:13,228 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 236 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:13,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 227 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 09:15:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 172. [2025-03-04 09:15:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 112 states have (on average 1.6875) internal successors, (189), 165 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2025-03-04 09:15:13,232 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 18 [2025-03-04 09:15:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:13,232 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2025-03-04 09:15:13,232 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-04 09:15:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2025-03-04 09:15:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:15:13,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:13,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:13,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:15:13,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:13,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash -6453730, now seen corresponding path program 1 times [2025-03-04 09:15:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094033481] [2025-03-04 09:15:13,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:13,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:15:13,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:15:13,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:13,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094033481] [2025-03-04 09:15:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094033481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057321832] [2025-03-04 09:15:13,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:13,386 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-04 09:15:13,388 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-04 09:15:13,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:15:13,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:15:13,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:13,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:13,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:15:13,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:13,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:13,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057321832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:15:13,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:15:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:15:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487734154] [2025-03-04 09:15:13,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:15:13,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:15:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:13,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:15:13,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:15:13,653 INFO L87 Difference]: Start difference. First operand 172 states and 197 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-04 09:15:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:13,693 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2025-03-04 09:15:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:15:13,694 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-03-04 09:15:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:13,694 INFO L225 Difference]: With dead ends: 190 [2025-03-04 09:15:13,695 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 09:15:13,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-04 09:15:13,695 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 4 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:13,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 447 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:15:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 09:15:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-04 09:15:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.5923076923076922) internal successors, (207), 183 states have internal predecessors, (207), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2025-03-04 09:15:13,703 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 18 [2025-03-04 09:15:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:13,704 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2025-03-04 09:15:13,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-04 09:15:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2025-03-04 09:15:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:15:13,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:13,705 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:13,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:15:13,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:13,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:13,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash 846487614, now seen corresponding path program 2 times [2025-03-04 09:15:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:13,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383767334] [2025-03-04 09:15:13,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:15:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:13,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:15:13,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:15:13,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:15:13,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:14,103 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-04 09:15:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:14,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383767334] [2025-03-04 09:15:14,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383767334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:14,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290531231] [2025-03-04 09:15:14,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:15:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:14,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:15:14,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:15:14,105 INFO L87 Difference]: Start difference. First operand 190 states and 215 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-04 09:15:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:14,295 INFO L93 Difference]: Finished difference Result 313 states and 335 transitions. [2025-03-04 09:15:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:14,296 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-04 09:15:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:14,297 INFO L225 Difference]: With dead ends: 313 [2025-03-04 09:15:14,297 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 09:15:14,297 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-04 09:15:14,298 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 304 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:14,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 269 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:15:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 09:15:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 189. [2025-03-04 09:15:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.5846153846153845) internal successors, (206), 182 states have internal predecessors, (206), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 214 transitions. [2025-03-04 09:15:14,303 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 214 transitions. Word has length 36 [2025-03-04 09:15:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:14,303 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 214 transitions. [2025-03-04 09:15:14,303 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-04 09:15:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2025-03-04 09:15:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:15:14,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:14,304 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:14,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:15:14,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash -551958992, now seen corresponding path program 1 times [2025-03-04 09:15:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:14,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177865954] [2025-03-04 09:15:14,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:14,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:15:14,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:15:14,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:14,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:14,570 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-04 09:15:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177865954] [2025-03-04 09:15:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177865954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:14,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:15:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929367393] [2025-03-04 09:15:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:14,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:14,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:14,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:14,571 INFO L87 Difference]: Start difference. First operand 189 states and 214 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-04 09:15:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:14,673 INFO L93 Difference]: Finished difference Result 235 states and 254 transitions. [2025-03-04 09:15:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:14,674 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-04 09:15:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:14,675 INFO L225 Difference]: With dead ends: 235 [2025-03-04 09:15:14,675 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 09:15:14,675 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-04 09:15:14,676 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 96 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:14,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 169 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 09:15:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 184. [2025-03-04 09:15:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 177 states have internal predecessors, (201), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2025-03-04 09:15:14,683 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 44 [2025-03-04 09:15:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2025-03-04 09:15:14,683 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-04 09:15:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2025-03-04 09:15:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:15:14,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:14,686 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:14,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:15:14,686 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -551958991, now seen corresponding path program 1 times [2025-03-04 09:15:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130422071] [2025-03-04 09:15:14,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:14,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:15:14,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:15:14,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:14,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:15,219 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-04 09:15:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:15,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130422071] [2025-03-04 09:15:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130422071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:15:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51181410] [2025-03-04 09:15:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:15,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:15:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:15,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:15:15,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:15,220 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-04 09:15:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:15,343 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2025-03-04 09:15:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:15:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-04 09:15:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:15,344 INFO L225 Difference]: With dead ends: 232 [2025-03-04 09:15:15,344 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 09:15:15,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:15,345 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 211 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:15,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 480 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 09:15:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 183. [2025-03-04 09:15:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 176 states have internal predecessors, (200), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2025-03-04 09:15:15,350 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 44 [2025-03-04 09:15:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:15,351 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2025-03-04 09:15:15,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-04 09:15:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2025-03-04 09:15:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:15:15,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:15,351 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-04 09:15:15,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:15:15,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:15,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2019758473, now seen corresponding path program 1 times [2025-03-04 09:15:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:15,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402654647] [2025-03-04 09:15:15,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:15,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:15:15,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:15:15,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:15,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:15,695 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-04 09:15:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402654647] [2025-03-04 09:15:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402654647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:15:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062035661] [2025-03-04 09:15:15,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:15,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:15:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:15,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:15:15,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:15,696 INFO L87 Difference]: Start difference. First operand 183 states and 208 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-04 09:15:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:15,870 INFO L93 Difference]: Finished difference Result 252 states and 274 transitions. [2025-03-04 09:15:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:15:15,870 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-04 09:15:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:15,871 INFO L225 Difference]: With dead ends: 252 [2025-03-04 09:15:15,871 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 09:15:15,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:15,871 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 335 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:15,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 221 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:15:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 09:15:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 196. [2025-03-04 09:15:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 189 states have internal predecessors, (221), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2025-03-04 09:15:15,877 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 47 [2025-03-04 09:15:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:15,877 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2025-03-04 09:15:15,877 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-04 09:15:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2025-03-04 09:15:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:15:15,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:15,878 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-04 09:15:15,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:15:15,878 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:15,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1866869876, now seen corresponding path program 1 times [2025-03-04 09:15:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142456849] [2025-03-04 09:15:15,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:15,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:15:15,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:15:15,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:15,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:16,463 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-04 09:15:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142456849] [2025-03-04 09:15:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142456849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:16,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:16,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:15:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936017919] [2025-03-04 09:15:16,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:16,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:15:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:16,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:15:16,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:16,465 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-04 09:15:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:16,827 INFO L93 Difference]: Finished difference Result 246 states and 282 transitions. [2025-03-04 09:15:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:16,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-04 09:15:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:16,828 INFO L225 Difference]: With dead ends: 246 [2025-03-04 09:15:16,828 INFO L226 Difference]: Without dead ends: 246 [2025-03-04 09:15:16,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:15:16,829 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 110 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:16,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 358 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:15:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-04 09:15:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 220. [2025-03-04 09:15:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 166 states have (on average 1.5662650602409638) internal successors, (260), 211 states have internal predecessors, (260), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:15:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 272 transitions. [2025-03-04 09:15:16,838 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 272 transitions. Word has length 50 [2025-03-04 09:15:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:16,838 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 272 transitions. [2025-03-04 09:15:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-04 09:15:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 272 transitions. [2025-03-04 09:15:16,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:15:16,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:16,839 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-04 09:15:16,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:15:16,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:16,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1866869877, now seen corresponding path program 1 times [2025-03-04 09:15:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529878497] [2025-03-04 09:15:16,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:16,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:15:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:15:16,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:16,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:17,023 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-04 09:15:17,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:17,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529878497] [2025-03-04 09:15:17,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529878497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:17,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:17,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:15:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376508037] [2025-03-04 09:15:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:17,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:17,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:17,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:17,025 INFO L87 Difference]: Start difference. First operand 220 states and 272 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-04 09:15:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:17,130 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2025-03-04 09:15:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:17,131 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-04 09:15:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:17,132 INFO L225 Difference]: With dead ends: 260 [2025-03-04 09:15:17,132 INFO L226 Difference]: Without dead ends: 260 [2025-03-04 09:15:17,132 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-04 09:15:17,132 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 89 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:17,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 165 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-04 09:15:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 202. [2025-03-04 09:15:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 195 states have internal predecessors, (229), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 237 transitions. [2025-03-04 09:15:17,137 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 237 transitions. Word has length 50 [2025-03-04 09:15:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 237 transitions. [2025-03-04 09:15:17,137 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-04 09:15:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 237 transitions. [2025-03-04 09:15:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:15:17,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:17,137 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] [2025-03-04 09:15:17,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:15:17,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:17,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1975445278, now seen corresponding path program 1 times [2025-03-04 09:15:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:17,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890552134] [2025-03-04 09:15:17,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:17,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:15:17,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:15:17,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:17,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 09:15:17,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890552134] [2025-03-04 09:15:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890552134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904620956] [2025-03-04 09:15:17,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:15:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:17,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:15:17,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:15:17,269 INFO L87 Difference]: Start difference. First operand 202 states and 237 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:15:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:17,395 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2025-03-04 09:15:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:15:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2025-03-04 09:15:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:17,396 INFO L225 Difference]: With dead ends: 240 [2025-03-04 09:15:17,396 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 09:15:17,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:15:17,397 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 176 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:17,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 205 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 09:15:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 201. [2025-03-04 09:15:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 153 states have (on average 1.4836601307189543) internal successors, (227), 194 states have internal predecessors, (227), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 235 transitions. [2025-03-04 09:15:17,401 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 235 transitions. Word has length 53 [2025-03-04 09:15:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:17,401 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 235 transitions. [2025-03-04 09:15:17,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:15:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 235 transitions. [2025-03-04 09:15:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:15:17,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:17,402 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] [2025-03-04 09:15:17,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:15:17,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:17,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1975445279, now seen corresponding path program 1 times [2025-03-04 09:15:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8513486] [2025-03-04 09:15:17,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:17,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:15:17,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:15:17,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:17,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 09:15:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8513486] [2025-03-04 09:15:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8513486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009313307] [2025-03-04 09:15:17,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:17,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:17,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:17,631 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-04 09:15:17,633 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-04 09:15:17,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:15:17,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:15:17,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:17,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:17,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 09:15:17,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 09:15:17,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:15:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009313307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:17,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:15:17,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 09:15:17,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652171563] [2025-03-04 09:15:17,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:17,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:15:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:17,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:15:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:15:17,889 INFO L87 Difference]: Start difference. First operand 201 states and 235 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:15:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:17,941 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2025-03-04 09:15:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2025-03-04 09:15:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:17,943 INFO L225 Difference]: With dead ends: 206 [2025-03-04 09:15:17,943 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 09:15:17,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:15:17,943 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 18 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:17,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 633 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:15:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 09:15:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2025-03-04 09:15:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 153 states have (on average 1.477124183006536) internal successors, (226), 194 states have internal predecessors, (226), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 234 transitions. [2025-03-04 09:15:17,948 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 234 transitions. Word has length 53 [2025-03-04 09:15:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:17,949 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 234 transitions. [2025-03-04 09:15:17,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:15:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 234 transitions. [2025-03-04 09:15:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:15:17,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:17,951 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-04 09:15:17,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:15:18,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 09:15:18,152 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:18,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -388689023, now seen corresponding path program 1 times [2025-03-04 09:15:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426661428] [2025-03-04 09:15:18,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:18,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:15:18,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:15:18,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:18,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:18,479 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-04 09:15:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426661428] [2025-03-04 09:15:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426661428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:18,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:15:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328504456] [2025-03-04 09:15:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:18,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:15:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:18,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:15:18,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:18,481 INFO L87 Difference]: Start difference. First operand 201 states and 234 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-04 09:15:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:18,621 INFO L93 Difference]: Finished difference Result 200 states and 232 transitions. [2025-03-04 09:15:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:18,622 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-04 09:15:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:18,622 INFO L225 Difference]: With dead ends: 200 [2025-03-04 09:15:18,623 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 09:15:18,623 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-04 09:15:18,623 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 99 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:18,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 355 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 09:15:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-04 09:15:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 193 states have internal predecessors, (224), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 232 transitions. [2025-03-04 09:15:18,627 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 232 transitions. Word has length 53 [2025-03-04 09:15:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:18,628 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 232 transitions. [2025-03-04 09:15:18,628 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-04 09:15:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 232 transitions. [2025-03-04 09:15:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:15:18,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:18,628 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-04 09:15:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:15:18,628 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:18,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -388689022, now seen corresponding path program 1 times [2025-03-04 09:15:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919905030] [2025-03-04 09:15:18,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:18,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:15:18,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:15:18,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:18,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:19,146 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-04 09:15:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919905030] [2025-03-04 09:15:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919905030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:19,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:19,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:15:19,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606887385] [2025-03-04 09:15:19,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:19,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:15:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:19,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:15:19,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:19,148 INFO L87 Difference]: Start difference. First operand 200 states and 232 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-04 09:15:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:19,326 INFO L93 Difference]: Finished difference Result 199 states and 230 transitions. [2025-03-04 09:15:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:19,327 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-04 09:15:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:19,327 INFO L225 Difference]: With dead ends: 199 [2025-03-04 09:15:19,327 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 09:15:19,328 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-04 09:15:19,328 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 92 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:19,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 465 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:15:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 09:15:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-04 09:15:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 192 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2025-03-04 09:15:19,332 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 53 [2025-03-04 09:15:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:19,332 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2025-03-04 09:15:19,332 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-04 09:15:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2025-03-04 09:15:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 09:15:19,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:19,333 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-04 09:15:19,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:15:19,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:19,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1984409163, now seen corresponding path program 1 times [2025-03-04 09:15:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311399571] [2025-03-04 09:15:19,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:19,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 09:15:19,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 09:15:19,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:19,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:19,426 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-04 09:15:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311399571] [2025-03-04 09:15:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311399571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:19,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254091507] [2025-03-04 09:15:19,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:19,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:19,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:19,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:19,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:19,429 INFO L87 Difference]: Start difference. First operand 199 states and 230 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-04 09:15:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:19,442 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2025-03-04 09:15:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:19,442 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-04 09:15:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:19,444 INFO L225 Difference]: With dead ends: 211 [2025-03-04 09:15:19,444 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 09:15:19,444 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-04 09:15:19,444 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 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-04 09:15:19,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:15:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 09:15:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2025-03-04 09:15:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 155 states have (on average 1.4451612903225806) internal successors, (224), 194 states have internal predecessors, (224), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 232 transitions. [2025-03-04 09:15:19,449 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 232 transitions. Word has length 57 [2025-03-04 09:15:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:19,450 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 232 transitions. [2025-03-04 09:15:19,450 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-04 09:15:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 232 transitions. [2025-03-04 09:15:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:15:19,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:19,450 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-04 09:15:19,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:15:19,451 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:19,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1386895294, now seen corresponding path program 1 times [2025-03-04 09:15:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:19,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060966004] [2025-03-04 09:15:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:19,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:15:19,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:15:19,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:19,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:20,203 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-04 09:15:20,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060966004] [2025-03-04 09:15:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060966004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:20,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:20,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:15:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155834335] [2025-03-04 09:15:20,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:20,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:15:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:20,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:15:20,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:15:20,205 INFO L87 Difference]: Start difference. First operand 201 states and 232 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-04 09:15:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:20,531 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2025-03-04 09:15:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:15:20,531 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-04 09:15:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:20,532 INFO L225 Difference]: With dead ends: 245 [2025-03-04 09:15:20,532 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 09:15:20,533 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-04 09:15:20,533 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 173 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:20,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 448 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:15:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 09:15:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 207. [2025-03-04 09:15:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 161 states have (on average 1.4472049689440993) internal successors, (233), 200 states have internal predecessors, (233), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2025-03-04 09:15:20,540 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 58 [2025-03-04 09:15:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:20,540 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2025-03-04 09:15:20,541 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-04 09:15:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2025-03-04 09:15:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:15:20,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:20,541 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-04 09:15:20,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:15:20,542 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:20,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1386895295, now seen corresponding path program 1 times [2025-03-04 09:15:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:20,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585655668] [2025-03-04 09:15:20,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:20,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:15:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:15:20,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:20,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:21,016 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-04 09:15:21,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585655668] [2025-03-04 09:15:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585655668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:21,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:21,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:15:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098289417] [2025-03-04 09:15:21,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:21,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:15:21,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:21,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:15:21,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:15:21,018 INFO L87 Difference]: Start difference. First operand 207 states and 241 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-04 09:15:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:21,292 INFO L93 Difference]: Finished difference Result 244 states and 270 transitions. [2025-03-04 09:15:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:15:21,292 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-04 09:15:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:21,293 INFO L225 Difference]: With dead ends: 244 [2025-03-04 09:15:21,293 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 09:15:21,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:15:21,294 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 258 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:21,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 519 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:15:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 09:15:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 207. [2025-03-04 09:15:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 161 states have (on average 1.434782608695652) internal successors, (231), 200 states have internal predecessors, (231), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2025-03-04 09:15:21,298 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 58 [2025-03-04 09:15:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:21,298 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2025-03-04 09:15:21,298 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-04 09:15:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2025-03-04 09:15:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 09:15:21,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:21,299 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-04 09:15:21,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:15:21,299 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:21,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1046245150, now seen corresponding path program 1 times [2025-03-04 09:15:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516079470] [2025-03-04 09:15:21,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:21,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:15:21,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:15:21,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:21,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:21,435 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-04 09:15:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516079470] [2025-03-04 09:15:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516079470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603314890] [2025-03-04 09:15:21,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:21,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:21,437 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-04 09:15:21,439 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-04 09:15:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:15:21,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:15:21,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:21,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:21,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:15:21,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:21,743 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-04 09:15:21,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:21,769 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-04 09:15:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603314890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:15:21,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:15:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:15:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261433560] [2025-03-04 09:15:21,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:15:21,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:15:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:21,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:15:21,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:21,770 INFO L87 Difference]: Start difference. First operand 207 states and 239 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-04 09:15:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:21,794 INFO L93 Difference]: Finished difference Result 236 states and 273 transitions. [2025-03-04 09:15:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:21,796 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-04 09:15:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:21,797 INFO L225 Difference]: With dead ends: 236 [2025-03-04 09:15:21,797 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 09:15:21,798 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-04 09:15:21,799 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 16 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:21,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 539 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:15:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 09:15:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2025-03-04 09:15:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 185 states have (on average 1.4324324324324325) internal successors, (265), 224 states have internal predecessors, (265), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 273 transitions. [2025-03-04 09:15:21,805 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 273 transitions. Word has length 62 [2025-03-04 09:15:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:21,805 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 273 transitions. [2025-03-04 09:15:21,805 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-04 09:15:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 273 transitions. [2025-03-04 09:15:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:15:21,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:21,805 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-04 09:15:21,816 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-04 09:15:22,006 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-04 09:15:22,006 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:22,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1925892103, now seen corresponding path program 1 times [2025-03-04 09:15:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:22,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141953366] [2025-03-04 09:15:22,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:22,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:22,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:15:22,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:15:22,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:22,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:23,015 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-04 09:15:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141953366] [2025-03-04 09:15:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141953366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064752122] [2025-03-04 09:15:23,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:23,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:23,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:23,018 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-04 09:15:23,019 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-04 09:15:23,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:15:23,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:15:23,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:23,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:23,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 09:15:23,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:23,289 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-04 09:15:23,310 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-04 09:15:23,326 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:15:23,327 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-04 09:15:23,357 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-04 09:15:23,362 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-04 09:15:23,411 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-04 09:15:23,416 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-04 09:15:23,471 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:15:23,472 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-04 09:15:23,480 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-04 09:15:23,576 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:15:23,576 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-04 09:15:23,588 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-04 09:15:23,636 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-04 09:15:23,640 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-04 09:15:23,659 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-04 09:15:23,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:23,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1883 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1882 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:15:23,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |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_1883 (Array Int Int)) (v_ArrVal_1882 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1883 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-03-04 09:15:23,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |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_1883 (Array Int Int)) (v_ArrVal_1882 (Array Int Int))) (<= (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1883 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-03-04 09:15:23,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1880) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1881) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1881))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1880) .cse1 v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 2) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1882) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:15:23,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1878))) (let ((.cse0 (select (select .cse1 |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_1879) .cse0 v_ArrVal_1880) (select (select (store .cse1 .cse0 v_ArrVal_1881) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1883))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1878))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1881))) (let ((.cse4 (select (select .cse5 |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_1879) .cse3 v_ArrVal_1880) .cse4 v_ArrVal_1883) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1882) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-03-04 09:15:23,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:15:23,916 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-04 09:15:23,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:15:23,922 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-04 09:15:23,930 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 20292 treesize of output 17036 [2025-03-04 09:15:24,027 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 27987 treesize of output 27083 [2025-03-04 09:15:24,090 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 1275 treesize of output 1011 [2025-03-04 09:15:24,125 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 1011 treesize of output 915 [2025-03-04 09:15:24,133 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 915 treesize of output 867 [2025-03-04 09:15:24,141 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 867 treesize of output 711 [2025-03-04 09:15:24,149 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 711 treesize of output 687 [2025-03-04 09:15:24,157 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 687 treesize of output 639 [2025-03-04 09:15:24,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:15:24,350 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-04 09:15:24,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:15:24,356 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-04 09:15:24,359 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:15:24,361 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-04 09:15:24,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:15:24,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:15:24,366 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-04 09:15:24,438 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 09:15:24,438 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-04 09:15:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-03-04 09:15:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064752122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:15:24,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:15:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-03-04 09:15:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889063083] [2025-03-04 09:15:24,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:15:24,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 09:15:24,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:24,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 09:15:24,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=588, Unknown=9, NotChecked=270, Total=992 [2025-03-04 09:15:24,446 INFO L87 Difference]: Start difference. First operand 231 states and 273 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-04 09:15:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:25,110 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2025-03-04 09:15:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:15:25,111 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-04 09:15:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:25,112 INFO L225 Difference]: With dead ends: 269 [2025-03-04 09:15:25,112 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 09:15:25,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=907, Unknown=9, NotChecked=340, Total=1482 [2025-03-04 09:15:25,113 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 294 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1006 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:25,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 697 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 589 Invalid, 0 Unknown, 1006 Unchecked, 0.4s Time] [2025-03-04 09:15:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 09:15:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-03-04 09:15:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 185 states have (on average 1.4216216216216215) internal successors, (263), 224 states have internal predecessors, (263), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 09:15:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 271 transitions. [2025-03-04 09:15:25,117 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 271 transitions. Word has length 63 [2025-03-04 09:15:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 271 transitions. [2025-03-04 09:15:25,117 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-04 09:15:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 271 transitions. [2025-03-04 09:15:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:15:25,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:25,117 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-04 09:15:25,126 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-04 09:15:25,322 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-04 09:15:25,322 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-04 09:15:25,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1925892104, now seen corresponding path program 1 times [2025-03-04 09:15:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744860056] [2025-03-04 09:15:25,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:25,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:15:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:15:25,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:25,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:25,879 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-04 09:15:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:25,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744860056] [2025-03-04 09:15:25,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744860056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:25,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935392451] [2025-03-04 09:15:25,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:25,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:25,882 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-04 09:15:25,883 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-04 09:15:26,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:15:26,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:15:26,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:26,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:26,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:15:26,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:26,162 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-04 09:15:26,181 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:15:26,182 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 17 treesize of output 21 [2025-03-04 09:15:26,205 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-04 09:15:26,239 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-04 09:15:26,288 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:15:26,289 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-04 09:15:26,339 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:15:26,339 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-04 09:15:26,357 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-04 09:15:26,388 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-04 09:15:26,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:26,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-03-04 09:15:26,411 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:15:26,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2108))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2109)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:15:26,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2108))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2109)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:15:26,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2107))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2108)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2109)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:15:26,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:15:26,462 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 106 treesize of output 71 [2025-03-04 09:15:26,466 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 5410 treesize of output 4106 [2025-03-04 09:15:26,504 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 822 treesize of output 708 [2025-03-04 09:15:26,510 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 708 treesize of output 624 [2025-03-04 09:15:26,515 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 624 treesize of output 498 [2025-03-04 09:15:28,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:15:28,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 209 treesize of output 1263