./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:31:47,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:31:47,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:31:47,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:31:47,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:31:47,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:31:47,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:31:47,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:31:47,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:31:47,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:31:47,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:31:47,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:31:47,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:31:47,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:31:47,373 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:31:47,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:31:47,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:31:47,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:31:47,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:31:47,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:31:47,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:31:47,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:31:47,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:31:47,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:31:47,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:31:47,376 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2025-03-08 21:31:47,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:31:47,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:31:47,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:31:47,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:31:47,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:31:47,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-03-08 21:31:48,706 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0592f944d/91376274046f4d74992b0c1a79bc5825/FLAG686811c9a [2025-03-08 21:31:49,017 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:31:49,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-03-08 21:31:49,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0592f944d/91376274046f4d74992b0c1a79bc5825/FLAG686811c9a [2025-03-08 21:31:49,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0592f944d/91376274046f4d74992b0c1a79bc5825 [2025-03-08 21:31:49,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:31:49,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:31:49,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:31:49,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:31:49,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:31:49,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcacdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49, skipping insertion in model container [2025-03-08 21:31:49,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:31:49,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i[33021,33034] [2025-03-08 21:31:49,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i[44124,44137] [2025-03-08 21:31:49,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i[44245,44258] [2025-03-08 21:31:49,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:31:49,710 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:31:49,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i[33021,33034] [2025-03-08 21:31:49,798 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i[44124,44137] [2025-03-08 21:31:49,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i[44245,44258] [2025-03-08 21:31:49,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:31:49,835 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:31:49,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49 WrapperNode [2025-03-08 21:31:49,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:31:49,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:31:49,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:31:49,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:31:49,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,897 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1537 [2025-03-08 21:31:49,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:31:49,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:31:49,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:31:49,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:31:49,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,984 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-08 21:31:49,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:49,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:50,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:50,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:50,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:50,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:50,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:31:50,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:31:50,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:31:50,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:31:50,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (1/1) ... [2025-03-08 21:31:50,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:31:50,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:31:50,082 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-08 21:31:50,085 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-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:31:50,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:31:50,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:31:50,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:31:50,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:31:50,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:31:50,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:31:50,286 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:31:50,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:31:51,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 21:31:51,422 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-03-08 21:31:51,422 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:31:51,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:31:51,464 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:31:51,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:31:51 BoogieIcfgContainer [2025-03-08 21:31:51,464 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:31:51,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:31:51,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:31:51,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:31:51,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:31:49" (1/3) ... [2025-03-08 21:31:51,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5d5c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:31:51, skipping insertion in model container [2025-03-08 21:31:51,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:31:49" (2/3) ... [2025-03-08 21:31:51,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5d5c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:31:51, skipping insertion in model container [2025-03-08 21:31:51,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:31:51" (3/3) ... [2025-03-08 21:31:51,471 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-2.i [2025-03-08 21:31:51,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:31:51,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test7-2.i that has 4 procedures, 430 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-08 21:31:51,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:31:51,530 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=LoopHeads, 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;@7cb95ffb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:31:51,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 21:31:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 422 states, 415 states have (on average 1.6240963855421686) internal successors, (674), 417 states have internal predecessors, (674), 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-08 21:31:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 21:31:51,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:51,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:31:51,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:51,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1649401392, now seen corresponding path program 1 times [2025-03-08 21:31:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143659814] [2025-03-08 21:31:51,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 21:31:51,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 21:31:51,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:51,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:51,660 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-08 21:31:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143659814] [2025-03-08 21:31:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143659814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:51,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:31:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752381568] [2025-03-08 21:31:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:51,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:31:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:51,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:31:51,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:31:51,681 INFO L87 Difference]: Start difference. First operand has 422 states, 415 states have (on average 1.6240963855421686) internal successors, (674), 417 states have internal predecessors, (674), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-08 21:31:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:51,806 INFO L93 Difference]: Finished difference Result 842 states and 1358 transitions. [2025-03-08 21:31:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:31:51,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-08 21:31:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:51,815 INFO L225 Difference]: With dead ends: 842 [2025-03-08 21:31:51,816 INFO L226 Difference]: Without dead ends: 386 [2025-03-08 21:31:51,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:31:51,821 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:51,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:31:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-08 21:31:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-08 21:31:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 380 states have (on average 1.4552631578947368) internal successors, (553), 381 states have internal predecessors, (553), 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-08 21:31:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 559 transitions. [2025-03-08 21:31:51,868 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 559 transitions. Word has length 8 [2025-03-08 21:31:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:51,868 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 559 transitions. [2025-03-08 21:31:51,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-08 21:31:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 559 transitions. [2025-03-08 21:31:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 21:31:51,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:51,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:31:51,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:31:51,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:51,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 951570077, now seen corresponding path program 1 times [2025-03-08 21:31:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:51,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33445332] [2025-03-08 21:31:51,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:51,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 21:31:51,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 21:31:51,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:51,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:31:52,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33445332] [2025-03-08 21:31:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33445332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:52,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:52,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:31:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108971269] [2025-03-08 21:31:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:52,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:31:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:52,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:31:52,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:31:52,038 INFO L87 Difference]: Start difference. First operand 386 states and 559 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:31:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:52,301 INFO L93 Difference]: Finished difference Result 953 states and 1384 transitions. [2025-03-08 21:31:52,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:31:52,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 21:31:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:52,307 INFO L225 Difference]: With dead ends: 953 [2025-03-08 21:31:52,307 INFO L226 Difference]: Without dead ends: 765 [2025-03-08 21:31:52,308 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-08 21:31:52,310 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 543 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:52,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1566 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:31:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-08 21:31:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 388. [2025-03-08 21:31:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 382 states have (on average 1.4528795811518325) internal successors, (555), 383 states have internal predecessors, (555), 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-08 21:31:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 561 transitions. [2025-03-08 21:31:52,327 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 561 transitions. Word has length 10 [2025-03-08 21:31:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:52,327 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 561 transitions. [2025-03-08 21:31:52,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:31:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 561 transitions. [2025-03-08 21:31:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 21:31:52,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:52,329 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:31:52,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:31:52,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:52,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:52,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1581376066, now seen corresponding path program 1 times [2025-03-08 21:31:52,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:52,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028156169] [2025-03-08 21:31:52,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:52,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:52,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 21:31:52,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 21:31:52,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:52,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:31:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:52,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028156169] [2025-03-08 21:31:52,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028156169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:52,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:31:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500785850] [2025-03-08 21:31:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:52,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:31:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:52,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:31:52,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:31:52,700 INFO L87 Difference]: Start difference. First operand 388 states and 561 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:31:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:52,854 INFO L93 Difference]: Finished difference Result 730 states and 1052 transitions. [2025-03-08 21:31:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:31:52,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-08 21:31:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:52,857 INFO L225 Difference]: With dead ends: 730 [2025-03-08 21:31:52,857 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 21:31:52,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 21:31:52,859 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 30 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:52,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1256 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:31:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 21:31:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-08 21:31:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 340 states have (on average 1.4058823529411764) internal successors, (478), 341 states have internal predecessors, (478), 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-08 21:31:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2025-03-08 21:31:52,871 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 84 [2025-03-08 21:31:52,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:52,871 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2025-03-08 21:31:52,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:31:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2025-03-08 21:31:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 21:31:52,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:52,873 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:31:52,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:31:52,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:52,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1250537161, now seen corresponding path program 1 times [2025-03-08 21:31:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:52,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100908872] [2025-03-08 21:31:52,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:52,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 21:31:52,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 21:31:52,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:52,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:31:53,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:53,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100908872] [2025-03-08 21:31:53,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100908872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:53,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:53,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:31:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29131851] [2025-03-08 21:31:53,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:53,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:31:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:53,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:31:53,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:31:53,071 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:31:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:53,280 INFO L93 Difference]: Finished difference Result 938 states and 1323 transitions. [2025-03-08 21:31:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:31:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-08 21:31:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:53,284 INFO L225 Difference]: With dead ends: 938 [2025-03-08 21:31:53,284 INFO L226 Difference]: Without dead ends: 596 [2025-03-08 21:31:53,285 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-08 21:31:53,288 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 296 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:53,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1030 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:31:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-08 21:31:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 589. [2025-03-08 21:31:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 583 states have (on average 1.4236706689536878) internal successors, (830), 584 states have internal predecessors, (830), 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-08 21:31:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2025-03-08 21:31:53,312 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 84 [2025-03-08 21:31:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:53,313 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2025-03-08 21:31:53,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:31:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2025-03-08 21:31:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 21:31:53,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:53,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:31:53,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:31:53,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash -86501339, now seen corresponding path program 1 times [2025-03-08 21:31:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:53,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336322004] [2025-03-08 21:31:53,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:53,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:31:53,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:31:53,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:31:53,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336322004] [2025-03-08 21:31:53,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336322004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:53,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:53,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:31:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616879980] [2025-03-08 21:31:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:53,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:31:53,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:53,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:31:53,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:31:53,707 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:31:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:53,903 INFO L93 Difference]: Finished difference Result 868 states and 1231 transitions. [2025-03-08 21:31:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:31:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-08 21:31:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:53,907 INFO L225 Difference]: With dead ends: 868 [2025-03-08 21:31:53,907 INFO L226 Difference]: Without dead ends: 864 [2025-03-08 21:31:53,907 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-08 21:31:53,908 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 453 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:53,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1266 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:31:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-08 21:31:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 591. [2025-03-08 21:31:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 585 states have (on average 1.4222222222222223) internal successors, (832), 586 states have internal predecessors, (832), 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-08 21:31:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 838 transitions. [2025-03-08 21:31:53,927 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 838 transitions. Word has length 99 [2025-03-08 21:31:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:53,928 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 838 transitions. [2025-03-08 21:31:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:31:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 838 transitions. [2025-03-08 21:31:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:31:53,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:53,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:31:53,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:31:53,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:53,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:53,934 INFO L85 PathProgramCache]: Analyzing trace with hash 639522725, now seen corresponding path program 1 times [2025-03-08 21:31:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:53,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672805512] [2025-03-08 21:31:53,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:53,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:31:54,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:31:54,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:54,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:31:54,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:54,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672805512] [2025-03-08 21:31:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672805512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:54,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:54,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:31:54,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295541933] [2025-03-08 21:31:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:54,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:31:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:54,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:31:54,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:31:54,191 INFO L87 Difference]: Start difference. First operand 591 states and 838 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:31:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:54,296 INFO L93 Difference]: Finished difference Result 852 states and 1214 transitions. [2025-03-08 21:31:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:31:54,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:31:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:54,298 INFO L225 Difference]: With dead ends: 852 [2025-03-08 21:31:54,299 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 21:31:54,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 21:31:54,300 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 30 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:54,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1034 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:31:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 21:31:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 21:31:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 501 states have (on average 1.3532934131736527) internal successors, (678), 502 states have internal predecessors, (678), 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-08 21:31:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 684 transitions. [2025-03-08 21:31:54,315 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 684 transitions. Word has length 151 [2025-03-08 21:31:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:54,316 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 684 transitions. [2025-03-08 21:31:54,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:31:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 684 transitions. [2025-03-08 21:31:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:31:54,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:54,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:31:54,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:31:54,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:54,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1596274337, now seen corresponding path program 1 times [2025-03-08 21:31:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:54,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689769487] [2025-03-08 21:31:54,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:54,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:31:54,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:31:54,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:54,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:31:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689769487] [2025-03-08 21:31:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689769487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:54,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:31:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079574064] [2025-03-08 21:31:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:31:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:54,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:31:54,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:31:54,495 INFO L87 Difference]: Start difference. First operand 507 states and 684 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:31:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:54,744 INFO L93 Difference]: Finished difference Result 1069 states and 1442 transitions. [2025-03-08 21:31:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:31:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-08 21:31:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:54,747 INFO L225 Difference]: With dead ends: 1069 [2025-03-08 21:31:54,747 INFO L226 Difference]: Without dead ends: 651 [2025-03-08 21:31:54,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 21:31:54,748 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 795 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:54,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 711 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:31:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-08 21:31:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 644. [2025-03-08 21:31:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 638 states have (on average 1.3557993730407523) internal successors, (865), 639 states have internal predecessors, (865), 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-08 21:31:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 871 transitions. [2025-03-08 21:31:54,763 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 871 transitions. Word has length 151 [2025-03-08 21:31:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:54,763 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 871 transitions. [2025-03-08 21:31:54,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:31:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 871 transitions. [2025-03-08 21:31:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 21:31:54,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:54,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:31:54,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:31:54,765 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:54,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1351309233, now seen corresponding path program 1 times [2025-03-08 21:31:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:54,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96749503] [2025-03-08 21:31:54,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:54,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:54,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:31:54,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:31:54,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:54,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:31:55,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96749503] [2025-03-08 21:31:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96749503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:31:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349689787] [2025-03-08 21:31:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:31:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:31:55,356 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-08 21:31:55,357 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-08 21:31:55,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:31:55,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:31:55,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:55,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:55,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 21:31:55,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:31:55,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:31:55,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:31:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:31:55,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:31:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:31:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349689787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:31:56,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:31:56,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-03-08 21:31:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578032299] [2025-03-08 21:31:56,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:31:56,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 21:31:56,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:56,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 21:31:56,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:31:56,041 INFO L87 Difference]: Start difference. First operand 644 states and 871 transitions. Second operand has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:31:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:56,480 INFO L93 Difference]: Finished difference Result 2882 states and 3908 transitions. [2025-03-08 21:31:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:31:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 161 [2025-03-08 21:31:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:56,489 INFO L225 Difference]: With dead ends: 2882 [2025-03-08 21:31:56,489 INFO L226 Difference]: Without dead ends: 2481 [2025-03-08 21:31:56,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:31:56,491 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 2203 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 4140 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:56,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 4140 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:31:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-08 21:31:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 984. [2025-03-08 21:31:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 974 states have (on average 1.3501026694045175) internal successors, (1315), 975 states have internal predecessors, (1315), 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-08 21:31:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1327 transitions. [2025-03-08 21:31:56,555 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1327 transitions. Word has length 161 [2025-03-08 21:31:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:56,556 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1327 transitions. [2025-03-08 21:31:56,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:31:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1327 transitions. [2025-03-08 21:31:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-08 21:31:56,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:56,559 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:31:56,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:31:56,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:31:56,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:56,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1905202741, now seen corresponding path program 1 times [2025-03-08 21:31:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842484855] [2025-03-08 21:31:56,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:56,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:31:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:31:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:31:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842484855] [2025-03-08 21:31:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842484855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:31:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050095401] [2025-03-08 21:31:59,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:59,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:31:59,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:31:59,283 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-08 21:31:59,285 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-08 21:31:59,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:31:59,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:31:59,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:59,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:59,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 21:31:59,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:31:59,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:31:59,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:00,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:00,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:00,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:32:00,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:32:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:32:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050095401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:32:00,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:32:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-03-08 21:32:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184553750] [2025-03-08 21:32:00,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:32:00,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:32:00,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:32:00,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:32:00,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:32:00,674 INFO L87 Difference]: Start difference. First operand 984 states and 1327 transitions. Second operand has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:32:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:32:01,974 INFO L93 Difference]: Finished difference Result 6116 states and 8303 transitions. [2025-03-08 21:32:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 21:32:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 383 [2025-03-08 21:32:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:32:01,994 INFO L225 Difference]: With dead ends: 6116 [2025-03-08 21:32:01,994 INFO L226 Difference]: Without dead ends: 5715 [2025-03-08 21:32:01,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 754 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-03-08 21:32:01,998 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 8719 mSDsluCounter, 13576 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8729 SdHoareTripleChecker+Valid, 15275 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:32:01,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8729 Valid, 15275 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 21:32:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-03-08 21:32:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 1830. [2025-03-08 21:32:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1814 states have (on average 1.346747519294377) internal successors, (2443), 1815 states have internal predecessors, (2443), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 21:32:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2467 transitions. [2025-03-08 21:32:02,082 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2467 transitions. Word has length 383 [2025-03-08 21:32:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:32:02,082 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2467 transitions. [2025-03-08 21:32:02,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:32:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2467 transitions. [2025-03-08 21:32:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-08 21:32:02,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:32:02,097 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:32:02,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:32:02,297 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,SelfDestructingSolverStorable8 [2025-03-08 21:32:02,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:32:02,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:32:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 140768829, now seen corresponding path program 2 times [2025-03-08 21:32:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:32:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805550554] [2025-03-08 21:32:02,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:32:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:32:02,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-08 21:32:02,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-08 21:32:02,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:32:02,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:32:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:32:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:32:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805550554] [2025-03-08 21:32:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805550554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:32:02,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:32:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:32:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079217143] [2025-03-08 21:32:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:32:02,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:32:02,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:32:02,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:32:02,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:32:02,598 INFO L87 Difference]: Start difference. First operand 1830 states and 2467 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:32:02,936 INFO L93 Difference]: Finished difference Result 2329 states and 3152 transitions. [2025-03-08 21:32:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:32:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 827 [2025-03-08 21:32:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:32:02,943 INFO L225 Difference]: With dead ends: 2329 [2025-03-08 21:32:02,943 INFO L226 Difference]: Without dead ends: 1931 [2025-03-08 21:32:02,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:32:02,944 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 80 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:32:02,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1632 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:32:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2025-03-08 21:32:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1836. [2025-03-08 21:32:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1820 states have (on average 1.3456043956043957) internal successors, (2449), 1821 states have internal predecessors, (2449), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 21:32:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2473 transitions. [2025-03-08 21:32:02,988 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2473 transitions. Word has length 827 [2025-03-08 21:32:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:32:02,989 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2473 transitions. [2025-03-08 21:32:02,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2473 transitions. [2025-03-08 21:32:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-08 21:32:03,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:32:03,003 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:32:03,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:32:03,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:32:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:32:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1501670124, now seen corresponding path program 1 times [2025-03-08 21:32:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:32:03,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539397023] [2025-03-08 21:32:03,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:32:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:32:03,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-08 21:32:03,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-08 21:32:03,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:32:03,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:32:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:32:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:32:04,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539397023] [2025-03-08 21:32:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539397023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:32:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:32:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:32:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977547059] [2025-03-08 21:32:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:32:04,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:32:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:32:04,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:32:04,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:32:04,933 INFO L87 Difference]: Start difference. First operand 1836 states and 2473 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:32:05,225 INFO L93 Difference]: Finished difference Result 2255 states and 3045 transitions. [2025-03-08 21:32:05,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:32:05,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 828 [2025-03-08 21:32:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:32:05,231 INFO L225 Difference]: With dead ends: 2255 [2025-03-08 21:32:05,232 INFO L226 Difference]: Without dead ends: 1851 [2025-03-08 21:32:05,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:32:05,233 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 14 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:32:05,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1517 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:32:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2025-03-08 21:32:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1848. [2025-03-08 21:32:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1832 states have (on average 1.3449781659388647) internal successors, (2464), 1833 states have internal predecessors, (2464), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 21:32:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2488 transitions. [2025-03-08 21:32:05,274 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2488 transitions. Word has length 828 [2025-03-08 21:32:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:32:05,275 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2488 transitions. [2025-03-08 21:32:05,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2488 transitions. [2025-03-08 21:32:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-08 21:32:05,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:32:05,281 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:32:05,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:32:05,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:32:05,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:32:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -75854677, now seen corresponding path program 1 times [2025-03-08 21:32:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:32:05,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114666055] [2025-03-08 21:32:05,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:32:05,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:32:05,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 21:32:05,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 21:32:05,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:32:05,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:32:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:32:12,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:32:12,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114666055] [2025-03-08 21:32:12,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114666055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:32:12,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338283157] [2025-03-08 21:32:12,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:32:12,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:32:12,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:32:12,576 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-08 21:32:12,579 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-08 21:32:13,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 21:32:13,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 21:32:13,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:32:13,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:32:13,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 21:32:13,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:32:13,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:32:13,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:13,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:13,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:32:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:32:14,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:32:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:32:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338283157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:32:15,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:32:15,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 42 [2025-03-08 21:32:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032443677] [2025-03-08 21:32:15,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:32:15,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 21:32:15,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:32:15,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 21:32:15,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 21:32:15,502 INFO L87 Difference]: Start difference. First operand 1848 states and 2488 transitions. Second operand has 42 states, 42 states have (on average 55.214285714285715) internal successors, (2319), 42 states have internal predecessors, (2319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:32:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:32:18,904 INFO L93 Difference]: Finished difference Result 13004 states and 17583 transitions. [2025-03-08 21:32:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 21:32:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 55.214285714285715) internal successors, (2319), 42 states have internal predecessors, (2319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 829 [2025-03-08 21:32:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:32:18,942 INFO L225 Difference]: With dead ends: 13004 [2025-03-08 21:32:18,942 INFO L226 Difference]: Without dead ends: 12585 [2025-03-08 21:32:18,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1699 GetRequests, 1635 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1128, Invalid=2778, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 21:32:18,950 INFO L435 NwaCegarLoop]: 3727 mSDtfsCounter, 17866 mSDsluCounter, 55302 mSDsCounter, 0 mSdLazyCounter, 6341 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17888 SdHoareTripleChecker+Valid, 59029 SdHoareTripleChecker+Invalid, 6422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 6341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:32:18,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17888 Valid, 59029 Invalid, 6422 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [81 Valid, 6341 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 21:32:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12585 states. [2025-03-08 21:32:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12585 to 3540. [2025-03-08 21:32:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 3512 states have (on average 1.3439635535307517) internal successors, (4720), 3513 states have internal predecessors, (4720), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 21:32:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4768 transitions. [2025-03-08 21:32:19,078 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4768 transitions. Word has length 829 [2025-03-08 21:32:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:32:19,079 INFO L471 AbstractCegarLoop]: Abstraction has 3540 states and 4768 transitions. [2025-03-08 21:32:19,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 55.214285714285715) internal successors, (2319), 42 states have internal predecessors, (2319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:32:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4768 transitions. [2025-03-08 21:32:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-08 21:32:19,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:32:19,097 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:32:19,116 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-08 21:32:19,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:32:19,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:32:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:32:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1743907653, now seen corresponding path program 2 times [2025-03-08 21:32:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:32:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860109930] [2025-03-08 21:32:19,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:32:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:32:19,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1717 statements into 2 equivalence classes. [2025-03-08 21:32:19,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 1717 statements. [2025-03-08 21:32:19,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:32:19,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:32:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-08 21:32:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:32:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860109930] [2025-03-08 21:32:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860109930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:32:20,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:32:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:32:20,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834653833] [2025-03-08 21:32:20,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:32:20,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:32:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:32:20,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:32:20,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:32:20,115 INFO L87 Difference]: Start difference. First operand 3540 states and 4768 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:32:20,642 INFO L93 Difference]: Finished difference Result 4019 states and 5418 transitions. [2025-03-08 21:32:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:32:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1717 [2025-03-08 21:32:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:32:20,654 INFO L225 Difference]: With dead ends: 4019 [2025-03-08 21:32:20,655 INFO L226 Difference]: Without dead ends: 3603 [2025-03-08 21:32:20,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:32:20,657 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 41 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:32:20,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2465 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:32:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2025-03-08 21:32:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3567. [2025-03-08 21:32:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 3539 states have (on average 1.3438824526702458) internal successors, (4756), 3540 states have internal predecessors, (4756), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 21:32:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4804 transitions. [2025-03-08 21:32:20,728 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4804 transitions. Word has length 1717 [2025-03-08 21:32:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:32:20,729 INFO L471 AbstractCegarLoop]: Abstraction has 3567 states and 4804 transitions. [2025-03-08 21:32:20,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4804 transitions. [2025-03-08 21:32:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-08 21:32:20,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:32:20,778 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:32:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:32:20,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:32:20,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:32:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1446859948, now seen corresponding path program 1 times [2025-03-08 21:32:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:32:20,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558516931] [2025-03-08 21:32:20,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:32:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:32:21,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-08 21:32:22,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-08 21:32:22,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:32:22,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:32:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-08 21:32:25,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:32:25,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558516931] [2025-03-08 21:32:25,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558516931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:32:25,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:32:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:32:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372686984] [2025-03-08 21:32:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:32:25,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:32:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:32:25,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:32:25,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:32:25,426 INFO L87 Difference]: Start difference. First operand 3567 states and 4804 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:32:25,811 INFO L93 Difference]: Finished difference Result 4016 states and 5418 transitions. [2025-03-08 21:32:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:32:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1717 [2025-03-08 21:32:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:32:25,818 INFO L225 Difference]: With dead ends: 4016 [2025-03-08 21:32:25,818 INFO L226 Difference]: Without dead ends: 3573 [2025-03-08 21:32:25,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:32:25,820 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 31 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:32:25,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2488 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:32:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-08 21:32:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3564. [2025-03-08 21:32:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3536 states have (on average 1.3424773755656108) internal successors, (4747), 3537 states have internal predecessors, (4747), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 21:32:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4795 transitions. [2025-03-08 21:32:25,884 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4795 transitions. Word has length 1717 [2025-03-08 21:32:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:32:25,886 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 4795 transitions. [2025-03-08 21:32:25,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4795 transitions. [2025-03-08 21:32:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-08 21:32:25,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:32:25,903 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:32:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:32:25,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:32:25,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:32:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash -866584679, now seen corresponding path program 1 times [2025-03-08 21:32:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:32:25,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164530812] [2025-03-08 21:32:25,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:32:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:32:26,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-08 21:32:27,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-08 21:32:27,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:32:27,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:32:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-08 21:32:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:32:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164530812] [2025-03-08 21:32:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164530812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:32:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:32:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:32:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573057955] [2025-03-08 21:32:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:32:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:32:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:32:29,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:32:29,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:32:29,561 INFO L87 Difference]: Start difference. First operand 3564 states and 4795 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:32:29,759 INFO L93 Difference]: Finished difference Result 4013 states and 5400 transitions. [2025-03-08 21:32:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:32:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1718 [2025-03-08 21:32:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:32:29,766 INFO L225 Difference]: With dead ends: 4013 [2025-03-08 21:32:29,766 INFO L226 Difference]: Without dead ends: 3573 [2025-03-08 21:32:29,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:32:29,768 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 8 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:32:29,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1536 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:32:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-08 21:32:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3573. [2025-03-08 21:32:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 3545 states have (on average 1.3416078984485191) internal successors, (4756), 3546 states have internal predecessors, (4756), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 21:32:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 4804 transitions. [2025-03-08 21:32:29,827 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 4804 transitions. Word has length 1718 [2025-03-08 21:32:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:32:29,828 INFO L471 AbstractCegarLoop]: Abstraction has 3573 states and 4804 transitions. [2025-03-08 21:32:29,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:32:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4804 transitions. [2025-03-08 21:32:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-08 21:32:29,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:32:29,846 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:32:29,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:32:29,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:32:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:32:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1669937669, now seen corresponding path program 1 times [2025-03-08 21:32:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:32:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191870033] [2025-03-08 21:32:29,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:32:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:32:30,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-08 21:32:30,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-08 21:32:30,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:32:30,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:33:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:33:03,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:33:03,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191870033] [2025-03-08 21:33:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191870033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:33:03,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574713619] [2025-03-08 21:33:03,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:33:03,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:33:03,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:33:03,405 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-08 21:33:03,405 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-08 21:33:04,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-08 21:33:05,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-08 21:33:05,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:33:05,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:33:05,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 8659 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 21:33:05,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:33:05,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:33:05,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:05,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:05,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:05,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:05,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:05,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:06,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:06,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:06,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:06,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:33:06,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11