./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_FNV_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 ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:24:29,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:24:29,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:24:29,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:24:29,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:24:29,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:24:29,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:24:29,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:24:29,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:24:29,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:24:29,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:24:29,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:24:29,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:24:29,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:24:29,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:24:29,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:24:29,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:24:29,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:24:29,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:24:29,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:24:29,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:24:29,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:24:29,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:24:29,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:24:29,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:24:29,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:29,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:24:29,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:24:29,144 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2025-03-17 10:24:29,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:24:29,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:24:29,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:24:29,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:24:29,458 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:24:29,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2025-03-17 10:24:30,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd76a893d/0f5704babb3c4bc98818fdfac98859e9/FLAG58f9b15a0 [2025-03-17 10:24:30,938 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:24:30,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2025-03-17 10:24:30,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd76a893d/0f5704babb3c4bc98818fdfac98859e9/FLAG58f9b15a0 [2025-03-17 10:24:30,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd76a893d/0f5704babb3c4bc98818fdfac98859e9 [2025-03-17 10:24:30,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:24:30,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:24:30,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:30,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:24:30,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:24:30,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:30" (1/1) ... [2025-03-17 10:24:30,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f903e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:30, skipping insertion in model container [2025-03-17 10:24:30,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:30" (1/1) ... [2025-03-17 10:24:31,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:24:31,281 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_FNV_test7-2.i[33021,33034] [2025-03-17 10:24:31,379 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_FNV_test7-2.i[44124,44137] [2025-03-17 10:24:31,380 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_FNV_test7-2.i[44245,44258] [2025-03-17 10:24:31,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:31,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:24:31,440 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_FNV_test7-2.i[33021,33034] [2025-03-17 10:24:31,495 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_FNV_test7-2.i[44124,44137] [2025-03-17 10:24:31,496 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_FNV_test7-2.i[44245,44258] [2025-03-17 10:24:31,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:31,533 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:24:31,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31 WrapperNode [2025-03-17 10:24:31,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:31,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:31,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:24:31,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:24:31,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,615 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1537 [2025-03-17 10:24:31,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:31,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:24:31,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:24:31,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:24:31,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,708 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 34, 265]. 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, 4, 58]. [2025-03-17 10:24:31,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:24:31,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:24:31,767 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:24:31,767 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:24:31,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (1/1) ... [2025-03-17 10:24:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:31,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:31,805 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-17 10:24:31,807 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-17 10:24:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:24:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:24:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:24:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:24:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:24:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:24:31,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:24:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:24:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:24:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:24:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:24:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:24:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:24:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:24:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:24:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:24:31,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:24:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:24:31,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:24:32,046 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:24:32,048 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:24:33,309 INFO L1322 $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-17 10:24:33,379 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-03-17 10:24:33,380 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:24:33,430 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:24:33,432 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:24:33,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:33 BoogieIcfgContainer [2025-03-17 10:24:33,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:24:33,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:24:33,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:24:33,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:24:33,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:24:30" (1/3) ... [2025-03-17 10:24:33,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456a22fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:33, skipping insertion in model container [2025-03-17 10:24:33,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:31" (2/3) ... [2025-03-17 10:24:33,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456a22fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:33, skipping insertion in model container [2025-03-17 10:24:33,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:33" (3/3) ... [2025-03-17 10:24:33,439 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-2.i [2025-03-17 10:24:33,451 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:24:33,453 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test7-2.i that has 4 procedures, 429 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-17 10:24:33,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:24:33,511 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;@15c31ee7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:24:33,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:24:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 421 states, 414 states have (on average 1.6256038647342994) internal successors, (673), 416 states have internal predecessors, (673), 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-17 10:24:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 10:24:33,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:33,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:33,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:33,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1768985098, now seen corresponding path program 1 times [2025-03-17 10:24:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553252146] [2025-03-17 10:24:33,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:33,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 10:24:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 10:24:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:33,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:33,650 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-17 10:24:33,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553252146] [2025-03-17 10:24:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553252146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:33,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:33,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:24:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616698060] [2025-03-17 10:24:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:33,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:24:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:33,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:24:33,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:24:33,670 INFO L87 Difference]: Start difference. First operand has 421 states, 414 states have (on average 1.6256038647342994) internal successors, (673), 416 states have internal predecessors, (673), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 10:24:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:33,772 INFO L93 Difference]: Finished difference Result 841 states and 1357 transitions. [2025-03-17 10:24:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:24:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-17 10:24:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:33,780 INFO L225 Difference]: With dead ends: 841 [2025-03-17 10:24:33,780 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 10:24:33,783 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-17 10:24:33,784 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 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-17 10:24:33,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 10:24:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 10:24:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 379 states have (on average 1.4564643799472297) internal successors, (552), 380 states have internal predecessors, (552), 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-17 10:24:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 558 transitions. [2025-03-17 10:24:33,837 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 558 transitions. Word has length 7 [2025-03-17 10:24:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:33,837 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 558 transitions. [2025-03-17 10:24:33,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 10:24:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 558 transitions. [2025-03-17 10:24:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 10:24:33,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:33,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:33,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:24:33,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:33,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash 371005527, now seen corresponding path program 1 times [2025-03-17 10:24:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:33,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476493201] [2025-03-17 10:24:33,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:33,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 10:24:33,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 10:24:33,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:33,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:33,969 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-17 10:24:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476493201] [2025-03-17 10:24:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476493201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:33,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:24:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446185979] [2025-03-17 10:24:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:33,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:33,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:33,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:33,971 INFO L87 Difference]: Start difference. First operand 385 states and 558 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:34,241 INFO L93 Difference]: Finished difference Result 952 states and 1383 transitions. [2025-03-17 10:24:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:34,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 10:24:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:34,245 INFO L225 Difference]: With dead ends: 952 [2025-03-17 10:24:34,245 INFO L226 Difference]: Without dead ends: 764 [2025-03-17 10:24:34,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:24:34,246 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 543 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:34,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1485 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-17 10:24:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 387. [2025-03-17 10:24:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 381 states have (on average 1.4540682414698163) internal successors, (554), 382 states have internal predecessors, (554), 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-17 10:24:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 560 transitions. [2025-03-17 10:24:34,269 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 560 transitions. Word has length 9 [2025-03-17 10:24:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:34,269 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 560 transitions. [2025-03-17 10:24:34,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 560 transitions. [2025-03-17 10:24:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:24:34,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:34,271 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] [2025-03-17 10:24:34,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:24:34,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:34,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash 270728060, now seen corresponding path program 1 times [2025-03-17 10:24:34,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:34,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980176194] [2025-03-17 10:24:34,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:34,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:24:34,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:24:34,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:34,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:34,628 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-17 10:24:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980176194] [2025-03-17 10:24:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980176194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118783035] [2025-03-17 10:24:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:34,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:34,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:34,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:34,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:34,632 INFO L87 Difference]: Start difference. First operand 387 states and 560 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-17 10:24:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:34,773 INFO L93 Difference]: Finished difference Result 729 states and 1051 transitions. [2025-03-17 10:24:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:24:34,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-03-17 10:24:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:34,775 INFO L225 Difference]: With dead ends: 729 [2025-03-17 10:24:34,775 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 10:24:34,776 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-17 10:24:34,777 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 30 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1253 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-17 10:24:34,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1253 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 10:24:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 10:24:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 339 states have (on average 1.407079646017699) internal successors, (477), 340 states have internal predecessors, (477), 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-17 10:24:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2025-03-17 10:24:34,791 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 83 [2025-03-17 10:24:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:34,791 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2025-03-17 10:24:34,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-17 10:24:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2025-03-17 10:24:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:24:34,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:34,793 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] [2025-03-17 10:24:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:24:34,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:34,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:34,795 INFO L85 PathProgramCache]: Analyzing trace with hash -60110845, now seen corresponding path program 1 times [2025-03-17 10:24:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723713999] [2025-03-17 10:24:34,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:34,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:34,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:24:34,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:24:34,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:34,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:34,981 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-17 10:24:34,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:34,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723713999] [2025-03-17 10:24:34,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723713999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:34,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:34,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:24:34,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568533156] [2025-03-17 10:24:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:34,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:24:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:34,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:24:34,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:34,982 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-17 10:24:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:35,154 INFO L93 Difference]: Finished difference Result 937 states and 1322 transitions. [2025-03-17 10:24:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:24:35,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2025-03-17 10:24:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:35,156 INFO L225 Difference]: With dead ends: 937 [2025-03-17 10:24:35,156 INFO L226 Difference]: Without dead ends: 595 [2025-03-17 10:24:35,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:35,158 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 296 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1028 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-17 10:24:35,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1028 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-17 10:24:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 588. [2025-03-17 10:24:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.4243986254295533) internal successors, (829), 583 states have internal predecessors, (829), 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-17 10:24:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 835 transitions. [2025-03-17 10:24:35,175 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 835 transitions. Word has length 83 [2025-03-17 10:24:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:35,176 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 835 transitions. [2025-03-17 10:24:35,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-17 10:24:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 835 transitions. [2025-03-17 10:24:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 10:24:35,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:35,180 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] [2025-03-17 10:24:35,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:24:35,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:35,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1987314581, now seen corresponding path program 1 times [2025-03-17 10:24:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:35,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192780813] [2025-03-17 10:24:35,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:35,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:24:35,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:24:35,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:35,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:35,530 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-17 10:24:35,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:35,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192780813] [2025-03-17 10:24:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192780813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237419218] [2025-03-17 10:24:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:35,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:35,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:35,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:35,533 INFO L87 Difference]: Start difference. First operand 588 states and 835 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-17 10:24:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:35,692 INFO L93 Difference]: Finished difference Result 867 states and 1230 transitions. [2025-03-17 10:24:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:35,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 98 [2025-03-17 10:24:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:35,696 INFO L225 Difference]: With dead ends: 867 [2025-03-17 10:24:35,696 INFO L226 Difference]: Without dead ends: 863 [2025-03-17 10:24:35,697 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-17 10:24:35,697 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:35,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1341 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-17 10:24:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 590. [2025-03-17 10:24:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 584 states have (on average 1.422945205479452) internal successors, (831), 585 states have internal predecessors, (831), 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-17 10:24:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 837 transitions. [2025-03-17 10:24:35,726 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 837 transitions. Word has length 98 [2025-03-17 10:24:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:35,729 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 837 transitions. [2025-03-17 10:24:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-17 10:24:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 837 transitions. [2025-03-17 10:24:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:24:35,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:35,735 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] [2025-03-17 10:24:35,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:24:35,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:35,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:35,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1250638613, now seen corresponding path program 1 times [2025-03-17 10:24:35,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:35,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525369045] [2025-03-17 10:24:35,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:35,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:24:35,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:24:35,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:35,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:36,020 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-17 10:24:36,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525369045] [2025-03-17 10:24:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525369045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:36,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:36,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:36,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626123825] [2025-03-17 10:24:36,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:36,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:36,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:36,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:36,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:36,022 INFO L87 Difference]: Start difference. First operand 590 states and 837 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-17 10:24:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:36,143 INFO L93 Difference]: Finished difference Result 851 states and 1213 transitions. [2025-03-17 10:24:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:24:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 150 [2025-03-17 10:24:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:36,146 INFO L225 Difference]: With dead ends: 851 [2025-03-17 10:24:36,146 INFO L226 Difference]: Without dead ends: 506 [2025-03-17 10:24:36,147 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-17 10:24:36,147 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 30 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1031 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-17 10:24:36,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1031 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-17 10:24:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-17 10:24:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 500 states have (on average 1.354) internal successors, (677), 501 states have internal predecessors, (677), 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-17 10:24:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 683 transitions. [2025-03-17 10:24:36,162 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 683 transitions. Word has length 150 [2025-03-17 10:24:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:36,162 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 683 transitions. [2025-03-17 10:24:36,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-17 10:24:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 683 transitions. [2025-03-17 10:24:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:24:36,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:36,164 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] [2025-03-17 10:24:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:24:36,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 808531621, now seen corresponding path program 1 times [2025-03-17 10:24:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110494773] [2025-03-17 10:24:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:36,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:24:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:24:36,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:36,392 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-17 10:24:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:36,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110494773] [2025-03-17 10:24:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110494773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:36,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:36,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544689168] [2025-03-17 10:24:36,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:36,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:36,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:36,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:36,393 INFO L87 Difference]: Start difference. First operand 506 states and 683 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-17 10:24:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:36,624 INFO L93 Difference]: Finished difference Result 1068 states and 1441 transitions. [2025-03-17 10:24:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:24:36,625 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 150 [2025-03-17 10:24:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:36,628 INFO L225 Difference]: With dead ends: 1068 [2025-03-17 10:24:36,628 INFO L226 Difference]: Without dead ends: 650 [2025-03-17 10:24:36,628 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-17 10:24:36,629 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 795 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 708 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-17 10:24:36,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 708 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-17 10:24:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 643. [2025-03-17 10:24:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 637 states have (on average 1.3563579277864992) internal successors, (864), 638 states have internal predecessors, (864), 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-17 10:24:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 870 transitions. [2025-03-17 10:24:36,645 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 870 transitions. Word has length 150 [2025-03-17 10:24:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:36,646 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 870 transitions. [2025-03-17 10:24:36,646 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-17 10:24:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 870 transitions. [2025-03-17 10:24:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 10:24:36,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:36,647 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] [2025-03-17 10:24:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:24:36,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1124492663, now seen corresponding path program 1 times [2025-03-17 10:24:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344693447] [2025-03-17 10:24:36,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:36,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:24:36,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:24:36,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:36,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:37,335 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-17 10:24:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344693447] [2025-03-17 10:24:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344693447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646260422] [2025-03-17 10:24:37,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:37,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:37,342 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-17 10:24:37,344 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-17 10:24:37,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:24:37,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:24:37,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:37,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:37,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 10:24:37,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:37,681 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-17 10:24:37,887 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 23 treesize of output 3 [2025-03-17 10:24:37,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:24:37,898 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-17 10:24:37,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:38,042 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-17 10:24:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646260422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:38,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:38,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-17 10:24:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028435787] [2025-03-17 10:24:38,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:38,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:24:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:38,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:24:38,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:24:38,044 INFO L87 Difference]: Start difference. First operand 643 states and 870 transitions. Second operand has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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-17 10:24:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:38,439 INFO L93 Difference]: Finished difference Result 2881 states and 3907 transitions. [2025-03-17 10:24:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:24:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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 160 [2025-03-17 10:24:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:38,449 INFO L225 Difference]: With dead ends: 2881 [2025-03-17 10:24:38,449 INFO L226 Difference]: Without dead ends: 2480 [2025-03-17 10:24:38,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:24:38,451 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1919 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:38,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 2525 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:24:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2025-03-17 10:24:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 983. [2025-03-17 10:24:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 973 states have (on average 1.3504624871531345) internal successors, (1314), 974 states have internal predecessors, (1314), 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-17 10:24:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1326 transitions. [2025-03-17 10:24:38,501 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1326 transitions. Word has length 160 [2025-03-17 10:24:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1326 transitions. [2025-03-17 10:24:38,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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-17 10:24:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1326 transitions. [2025-03-17 10:24:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-17 10:24:38,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:38,506 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] [2025-03-17 10:24:38,515 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-17 10:24:38,706 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-17 10:24:38,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:38,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1045908101, now seen corresponding path program 1 times [2025-03-17 10:24:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:38,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262945858] [2025-03-17 10:24:38,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:38,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:24:39,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:24:39,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:39,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:41,294 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-17 10:24:41,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262945858] [2025-03-17 10:24:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262945858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865244070] [2025-03-17 10:24:41,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:41,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:41,296 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-17 10:24:41,298 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-17 10:24:41,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:24:41,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:24:41,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:41,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:41,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 10:24:41,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:41,869 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-17 10:24:42,022 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 23 treesize of output 3 [2025-03-17 10:24:42,130 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 36 treesize of output 13 [2025-03-17 10:24:42,229 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 36 treesize of output 13 [2025-03-17 10:24:42,333 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 36 treesize of output 13 [2025-03-17 10:24:42,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:24:42,345 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-17 10:24:42,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:42,808 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-17 10:24:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865244070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:42,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-03-17 10:24:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393101803] [2025-03-17 10:24:42,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:42,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 10:24:42,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:42,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 10:24:42,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-17 10:24:42,811 INFO L87 Difference]: Start difference. First operand 983 states and 1326 transitions. Second operand has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 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-17 10:24:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:43,723 INFO L93 Difference]: Finished difference Result 6115 states and 8302 transitions. [2025-03-17 10:24:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 10:24:43,724 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 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 382 [2025-03-17 10:24:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:43,749 INFO L225 Difference]: With dead ends: 6115 [2025-03-17 10:24:43,749 INFO L226 Difference]: Without dead ends: 5714 [2025-03-17 10:24:43,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-03-17 10:24:43,753 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 4794 mSDsluCounter, 4201 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4804 SdHoareTripleChecker+Valid, 4594 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:43,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4804 Valid, 4594 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:24:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2025-03-17 10:24:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 1829. [2025-03-17 10:24:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1813 states have (on average 1.346938775510204) internal successors, (2442), 1814 states have internal predecessors, (2442), 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-17 10:24:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2466 transitions. [2025-03-17 10:24:43,875 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2466 transitions. Word has length 382 [2025-03-17 10:24:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:43,876 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2466 transitions. [2025-03-17 10:24:43,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.35) internal successors, (767), 20 states have internal predecessors, (767), 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-17 10:24:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2466 transitions. [2025-03-17 10:24:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-17 10:24:43,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:43,897 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] [2025-03-17 10:24:43,914 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-17 10:24:44,101 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-17 10:24:44,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:44,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash -568862589, now seen corresponding path program 2 times [2025-03-17 10:24:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171129288] [2025-03-17 10:24:44,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:24:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:44,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 826 statements into 2 equivalence classes. [2025-03-17 10:24:44,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 71 of 826 statements. [2025-03-17 10:24:44,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:24:44,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:44,447 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-17 10:24:44,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:44,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171129288] [2025-03-17 10:24:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171129288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:44,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:24:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62677276] [2025-03-17 10:24:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:44,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:24:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:44,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:24:44,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:44,449 INFO L87 Difference]: Start difference. First operand 1829 states and 2466 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-17 10:24:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:44,782 INFO L93 Difference]: Finished difference Result 2328 states and 3151 transitions. [2025-03-17 10:24:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:24:44,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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 826 [2025-03-17 10:24:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:44,793 INFO L225 Difference]: With dead ends: 2328 [2025-03-17 10:24:44,794 INFO L226 Difference]: Without dead ends: 1930 [2025-03-17 10:24:44,795 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-17 10:24:44,796 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 80 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1627 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-17 10:24:44,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1627 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:24:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-03-17 10:24:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1835. [2025-03-17 10:24:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1819 states have (on average 1.3457943925233644) internal successors, (2448), 1820 states have internal predecessors, (2448), 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-17 10:24:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2472 transitions. [2025-03-17 10:24:44,844 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2472 transitions. Word has length 826 [2025-03-17 10:24:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:44,845 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2472 transitions. [2025-03-17 10:24:44,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-17 10:24:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2472 transitions. [2025-03-17 10:24:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-17 10:24:44,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:44,860 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-17 10:24:44,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:24:44,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:44,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash 977932646, now seen corresponding path program 1 times [2025-03-17 10:24:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:44,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878583377] [2025-03-17 10:24:44,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:45,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-17 10:24:45,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-17 10:24:45,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:45,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:46,736 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-17 10:24:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878583377] [2025-03-17 10:24:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878583377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:24:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603752189] [2025-03-17 10:24:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:46,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:24:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:46,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:24:46,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:46,739 INFO L87 Difference]: Start difference. First operand 1835 states and 2472 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-17 10:24:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:47,040 INFO L93 Difference]: Finished difference Result 2254 states and 3044 transitions. [2025-03-17 10:24:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:24:47,040 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-17 10:24:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:47,049 INFO L225 Difference]: With dead ends: 2254 [2025-03-17 10:24:47,049 INFO L226 Difference]: Without dead ends: 1850 [2025-03-17 10:24:47,050 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-17 10:24:47,051 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 14 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1512 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-17 10:24:47,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1512 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:24:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-03-17 10:24:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1847. [2025-03-17 10:24:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1831 states have (on average 1.345166575641726) internal successors, (2463), 1832 states have internal predecessors, (2463), 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-17 10:24:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2487 transitions. [2025-03-17 10:24:47,096 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2487 transitions. Word has length 827 [2025-03-17 10:24:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2487 transitions. [2025-03-17 10:24:47,097 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-17 10:24:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2487 transitions. [2025-03-17 10:24:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 10:24:47,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:47,103 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-17 10:24:47,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:24:47,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:47,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 868152689, now seen corresponding path program 1 times [2025-03-17 10:24:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417890933] [2025-03-17 10:24:47,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:47,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-17 10:24:47,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-17 10:24:47,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:47,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:56,241 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-17 10:24:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:56,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417890933] [2025-03-17 10:24:56,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417890933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:56,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330178711] [2025-03-17 10:24:56,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:56,243 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-17 10:24:56,245 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-17 10:24:56,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-17 10:24:57,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-17 10:24:57,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:57,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:57,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 4149 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 10:24:57,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:57,437 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-17 10:24:57,578 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 23 treesize of output 3 [2025-03-17 10:24:57,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:24:57,732 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 36 treesize of output 13 [2025-03-17 10:24:57,807 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 36 treesize of output 13 [2025-03-17 10:24:57,883 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 36 treesize of output 13 [2025-03-17 10:24:57,959 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 36 treesize of output 13 [2025-03-17 10:24:58,034 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 36 treesize of output 13 [2025-03-17 10:24:58,118 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 36 treesize of output 13 [2025-03-17 10:24:58,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 36 treesize of output 13 [2025-03-17 10:24:58,261 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 36 treesize of output 13 [2025-03-17 10:24:58,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:24:58,271 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-17 10:24:58,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:59,164 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-17 10:24:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330178711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:59,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 38 [2025-03-17 10:24:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416489532] [2025-03-17 10:24:59,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 10:24:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:59,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 10:24:59,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 10:24:59,172 INFO L87 Difference]: Start difference. First operand 1847 states and 2487 transitions. Second operand has 38 states, 38 states have (on average 43.921052631578945) internal successors, (1669), 38 states have internal predecessors, (1669), 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-17 10:25:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:25:01,363 INFO L93 Difference]: Finished difference Result 13003 states and 17582 transitions. [2025-03-17 10:25:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 10:25:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 43.921052631578945) internal successors, (1669), 38 states have internal predecessors, (1669), 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 828 [2025-03-17 10:25:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:25:01,401 INFO L225 Difference]: With dead ends: 13003 [2025-03-17 10:25:01,401 INFO L226 Difference]: Without dead ends: 12584 [2025-03-17 10:25:01,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1695 GetRequests, 1644 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 10:25:01,407 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 16151 mSDsluCounter, 9871 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16173 SdHoareTripleChecker+Valid, 10264 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:25:01,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16173 Valid, 10264 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 10:25:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12584 states. [2025-03-17 10:25:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12584 to 3539. [2025-03-17 10:25:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3511 states have (on average 1.3440615209342068) internal successors, (4719), 3512 states have internal predecessors, (4719), 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-17 10:25:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 4767 transitions. [2025-03-17 10:25:01,519 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 4767 transitions. Word has length 828 [2025-03-17 10:25:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:25:01,520 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 4767 transitions. [2025-03-17 10:25:01,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 43.921052631578945) internal successors, (1669), 38 states have internal predecessors, (1669), 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-17 10:25:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 4767 transitions. [2025-03-17 10:25:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1717 [2025-03-17 10:25:01,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:25:01,537 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] [2025-03-17 10:25:01,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:25:01,741 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-17 10:25:01,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:25:01,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:25:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash -680393855, now seen corresponding path program 2 times [2025-03-17 10:25:01,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:25:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606664593] [2025-03-17 10:25:01,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:25:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:25:02,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1716 statements into 2 equivalence classes. [2025-03-17 10:25:02,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 1716 statements. [2025-03-17 10:25:02,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:25:02,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:02,363 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-17 10:25:02,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:25:02,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606664593] [2025-03-17 10:25:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606664593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:25:02,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:25:02,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:25:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100012105] [2025-03-17 10:25:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:25:02,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:25:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:25:02,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:25:02,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:25:02,365 INFO L87 Difference]: Start difference. First operand 3539 states and 4767 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:25:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:25:03,035 INFO L93 Difference]: Finished difference Result 4018 states and 5417 transitions. [2025-03-17 10:25:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:25:03,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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 1716 [2025-03-17 10:25:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:25:03,045 INFO L225 Difference]: With dead ends: 4018 [2025-03-17 10:25:03,045 INFO L226 Difference]: Without dead ends: 3602 [2025-03-17 10:25:03,047 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-17 10:25:03,048 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 41 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2457 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:25:03,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2457 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:25:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2025-03-17 10:25:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3566. [2025-03-17 10:25:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3538 states have (on average 1.3439796495195024) internal successors, (4755), 3539 states have internal predecessors, (4755), 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-17 10:25:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4803 transitions. [2025-03-17 10:25:03,141 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4803 transitions. Word has length 1716 [2025-03-17 10:25:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:25:03,142 INFO L471 AbstractCegarLoop]: Abstraction has 3566 states and 4803 transitions. [2025-03-17 10:25:03,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:25:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4803 transitions. [2025-03-17 10:25:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1717 [2025-03-17 10:25:03,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:25:03,158 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] [2025-03-17 10:25:03,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:25:03,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:25:03,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:25:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash -383346150, now seen corresponding path program 1 times [2025-03-17 10:25:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:25:03,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701044215] [2025-03-17 10:25:03,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:25:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:25:03,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1716 statements into 1 equivalence classes. [2025-03-17 10:25:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1716 of 1716 statements. [2025-03-17 10:25:04,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:25:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:08,027 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-17 10:25:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:25:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701044215] [2025-03-17 10:25:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701044215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:25:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:25:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:25:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530496021] [2025-03-17 10:25:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:25:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:25:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:25:08,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:25:08,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:25:08,030 INFO L87 Difference]: Start difference. First operand 3566 states and 4803 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:25:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:25:08,413 INFO L93 Difference]: Finished difference Result 4015 states and 5417 transitions. [2025-03-17 10:25:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:25:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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 1716 [2025-03-17 10:25:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:25:08,421 INFO L225 Difference]: With dead ends: 4015 [2025-03-17 10:25:08,422 INFO L226 Difference]: Without dead ends: 3572 [2025-03-17 10:25:08,423 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-17 10:25:08,424 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 31 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2480 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-17 10:25:08,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2480 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:25:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3572 states. [2025-03-17 10:25:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3572 to 3563. [2025-03-17 10:25:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3535 states have (on average 1.3425742574257427) internal successors, (4746), 3536 states have internal predecessors, (4746), 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-17 10:25:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4794 transitions. [2025-03-17 10:25:08,513 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4794 transitions. Word has length 1716 [2025-03-17 10:25:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:25:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 4794 transitions. [2025-03-17 10:25:08,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:25:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4794 transitions. [2025-03-17 10:25:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:25:08,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:25:08,530 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-17 10:25:08,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:25:08,530 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:25:08,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:25:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2037571987, now seen corresponding path program 1 times [2025-03-17 10:25:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:25:08,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842460720] [2025-03-17 10:25:08,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:25:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:25:08,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-17 10:25:09,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-17 10:25:09,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:25:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:12,442 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-17 10:25:12,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:25:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842460720] [2025-03-17 10:25:12,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842460720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:25:12,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:25:12,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:25:12,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679914383] [2025-03-17 10:25:12,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:25:12,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:25:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:25:12,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:25:12,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:25:12,445 INFO L87 Difference]: Start difference. First operand 3563 states and 4794 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-17 10:25:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:25:12,745 INFO L93 Difference]: Finished difference Result 4012 states and 5399 transitions. [2025-03-17 10:25:12,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:25:12,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-17 10:25:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:25:12,753 INFO L225 Difference]: With dead ends: 4012 [2025-03-17 10:25:12,753 INFO L226 Difference]: Without dead ends: 3572 [2025-03-17 10:25:12,757 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-17 10:25:12,757 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 8 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1531 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-17 10:25:12,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1531 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:25:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3572 states. [2025-03-17 10:25:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3572 to 3572. [2025-03-17 10:25:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3544 states have (on average 1.341704288939052) internal successors, (4755), 3545 states have internal predecessors, (4755), 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-17 10:25:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4803 transitions. [2025-03-17 10:25:12,822 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4803 transitions. Word has length 1717 [2025-03-17 10:25:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:25:12,823 INFO L471 AbstractCegarLoop]: Abstraction has 3572 states and 4803 transitions. [2025-03-17 10:25:12,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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-17 10:25:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4803 transitions. [2025-03-17 10:25:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:25:12,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:25:12,840 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-17 10:25:12,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:25:12,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:25:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:25:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 279127039, now seen corresponding path program 1 times [2025-03-17 10:25:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:25:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918994429] [2025-03-17 10:25:12,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:25:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:25:13,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-17 10:25:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-17 10:25:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:25:13,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat