./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:02:28,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:02:28,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:02:28,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:02:28,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:02:28,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:02:28,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:02:28,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:02:28,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:02:28,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:02:28,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:02:28,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:02:28,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:02:28,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:02:28,807 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:02:28,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:02:28,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:02:28,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:02:28,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:02:28,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:02:28,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:02:28,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:02:28,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:28,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:02:28,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:02:28,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:02:28,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:02:28,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:02:28,810 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2025-03-17 06:02:29,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:02:29,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:02:29,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:02:29,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:02:29,045 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:02:29,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2025-03-17 06:02:30,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62d82a2d/da8f84da7f324113bc9e461bd1f55a9b/FLAGf70576fea [2025-03-17 06:02:30,490 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:02:30,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2025-03-17 06:02:30,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62d82a2d/da8f84da7f324113bc9e461bd1f55a9b/FLAGf70576fea [2025-03-17 06:02:30,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62d82a2d/da8f84da7f324113bc9e461bd1f55a9b [2025-03-17 06:02:30,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:02:30,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:02:30,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:30,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:02:30,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:02:30,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:30" (1/1) ... [2025-03-17 06:02:30,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62392389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:30, skipping insertion in model container [2025-03-17 06:02:30,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:30" (1/1) ... [2025-03-17 06:02:30,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:02:30,921 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i[916,929] [2025-03-17 06:02:30,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:30,999 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:02:31,007 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i[916,929] [2025-03-17 06:02:31,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:31,058 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:02:31,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31 WrapperNode [2025-03-17 06:02:31,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:31,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:31,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:02:31,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:02:31,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,128 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2025-03-17 06:02:31,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:31,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:02:31,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:02:31,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:02:31,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,156 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:02:31,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:02:31,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:02:31,178 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:02:31,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:02:31,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:31,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:31,210 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 06:02:31,215 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 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:02:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:02:31,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:02:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:02:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:02:31,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:02:31,333 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:02:31,335 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:02:31,744 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem78#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite91#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite122#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~bitwise109#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-17 06:02:31,776 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-17 06:02:31,776 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:02:31,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:02:31,791 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:02:31,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:31 BoogieIcfgContainer [2025-03-17 06:02:31,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:02:31,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:02:31,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:02:31,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:02:31,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:02:30" (1/3) ... [2025-03-17 06:02:31,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:31, skipping insertion in model container [2025-03-17 06:02:31,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (2/3) ... [2025-03-17 06:02:31,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:31, skipping insertion in model container [2025-03-17 06:02:31,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:31" (3/3) ... [2025-03-17 06:02:31,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2025-03-17 06:02:31,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:02:31,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-83.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:02:31,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:02:31,859 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;@5380f101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:02:31,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:02:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 06:02:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:02:31,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:31,873 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:31,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:31,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1824563043, now seen corresponding path program 1 times [2025-03-17 06:02:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964098481] [2025-03-17 06:02:31,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:31,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:02:32,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:02:32,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 06:02:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964098481] [2025-03-17 06:02:32,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964098481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:32,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607716001] [2025-03-17 06:02:32,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:32,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:32,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:32,141 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 06:02:32,142 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 06:02:32,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:02:32,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:02:32,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:02:32,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 06:02:32,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:32,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607716001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:32,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:02:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674778646] [2025-03-17 06:02:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:32,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:02:32,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:32,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:02:32,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:32,366 INFO L87 Difference]: Start difference. First operand has 106 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 06:02:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:32,389 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2025-03-17 06:02:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:02:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2025-03-17 06:02:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:32,399 INFO L225 Difference]: With dead ends: 209 [2025-03-17 06:02:32,400 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 06:02:32,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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 06:02:32,404 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:32,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 06:02:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 06:02:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 06:02:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2025-03-17 06:02:32,440 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 102 [2025-03-17 06:02:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:32,441 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2025-03-17 06:02:32,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 06:02:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2025-03-17 06:02:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:02:32,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:32,445 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:32,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:02:32,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:02:32,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:32,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash 32588052, now seen corresponding path program 1 times [2025-03-17 06:02:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:32,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676300462] [2025-03-17 06:02:32,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:32,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:02:32,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:02:32,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676300462] [2025-03-17 06:02:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676300462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046206308] [2025-03-17 06:02:32,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:32,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:32,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:32,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:32,943 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:32,991 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2025-03-17 06:02:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-03-17 06:02:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:32,993 INFO L225 Difference]: With dead ends: 210 [2025-03-17 06:02:32,994 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 06:02:32,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:32,996 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:32,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 421 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 06:02:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-03-17 06:02:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 06:02:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2025-03-17 06:02:33,011 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 102 [2025-03-17 06:02:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:33,012 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2025-03-17 06:02:33,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2025-03-17 06:02:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:02:33,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:33,015 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:02:33,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1774866411, now seen corresponding path program 1 times [2025-03-17 06:02:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605355540] [2025-03-17 06:02:33,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:33,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:02:33,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:02:33,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:33,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605355540] [2025-03-17 06:02:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605355540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:33,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:33,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789192940] [2025-03-17 06:02:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:33,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:33,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:33,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:33,223 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:33,251 INFO L93 Difference]: Finished difference Result 214 states and 305 transitions. [2025-03-17 06:02:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-03-17 06:02:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:33,253 INFO L225 Difference]: With dead ends: 214 [2025-03-17 06:02:33,253 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 06:02:33,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:33,256 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:33,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 06:02:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-17 06:02:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 06:02:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-03-17 06:02:33,267 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 102 [2025-03-17 06:02:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:33,268 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-03-17 06:02:33,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-03-17 06:02:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:02:33,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:33,269 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:33,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:02:33,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -887362730, now seen corresponding path program 1 times [2025-03-17 06:02:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122794601] [2025-03-17 06:02:33,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:33,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:02:33,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:02:33,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:33,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:33,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:33,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122794601] [2025-03-17 06:02:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122794601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759569254] [2025-03-17 06:02:33,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:33,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:33,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:33,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:33,403 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:33,441 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2025-03-17 06:02:33,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:33,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-03-17 06:02:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:33,444 INFO L225 Difference]: With dead ends: 218 [2025-03-17 06:02:33,444 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:02:33,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:33,446 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:33,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:02:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-17 06:02:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 06:02:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2025-03-17 06:02:33,456 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 102 [2025-03-17 06:02:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:33,456 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2025-03-17 06:02:33,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2025-03-17 06:02:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:02:33,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:33,457 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:33,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:02:33,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:33,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -886439209, now seen corresponding path program 1 times [2025-03-17 06:02:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490841046] [2025-03-17 06:02:33,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:33,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:02:33,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:02:33,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:33,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490841046] [2025-03-17 06:02:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490841046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:33,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:33,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:33,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918862056] [2025-03-17 06:02:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:33,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:33,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:33,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:33,787 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:34,013 INFO L93 Difference]: Finished difference Result 256 states and 362 transitions. [2025-03-17 06:02:34,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:34,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-03-17 06:02:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:34,017 INFO L225 Difference]: With dead ends: 256 [2025-03-17 06:02:34,017 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 06:02:34,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 06:02:34,018 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 134 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:34,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 285 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 06:02:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2025-03-17 06:02:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 06:02:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2025-03-17 06:02:34,033 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 102 [2025-03-17 06:02:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:34,033 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2025-03-17 06:02:34,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2025-03-17 06:02:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 06:02:34,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:34,037 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:34,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:02:34,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:34,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash -457676208, now seen corresponding path program 1 times [2025-03-17 06:02:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:34,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185747529] [2025-03-17 06:02:34,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:34,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 06:02:34,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 06:02:34,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:34,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:34,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185747529] [2025-03-17 06:02:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185747529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:34,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118416793] [2025-03-17 06:02:34,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:34,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:34,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:34,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:34,258 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:34,483 INFO L93 Difference]: Finished difference Result 221 states and 310 transitions. [2025-03-17 06:02:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:34,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-17 06:02:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:34,485 INFO L225 Difference]: With dead ends: 221 [2025-03-17 06:02:34,485 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 06:02:34,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:34,486 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:34,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 419 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 06:02:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 06:02:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 06:02:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2025-03-17 06:02:34,498 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 103 [2025-03-17 06:02:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:34,499 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2025-03-17 06:02:34,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2025-03-17 06:02:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:02:34,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:34,500 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:34,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:02:34,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:34,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash -969731726, now seen corresponding path program 1 times [2025-03-17 06:02:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676090058] [2025-03-17 06:02:34,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:34,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:34,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:34,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:34,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676090058] [2025-03-17 06:02:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676090058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:35,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:02:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678236582] [2025-03-17 06:02:35,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:35,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:02:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:35,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:02:35,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:35,648 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 06:02:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:36,187 INFO L93 Difference]: Finished difference Result 303 states and 419 transitions. [2025-03-17 06:02:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:02:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-03-17 06:02:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:36,188 INFO L225 Difference]: With dead ends: 303 [2025-03-17 06:02:36,189 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 06:02:36,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:02:36,190 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 82 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:36,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 668 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:02:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 06:02:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-03-17 06:02:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 172 states have internal predecessors, (231), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:02:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 261 transitions. [2025-03-17 06:02:36,207 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 261 transitions. Word has length 104 [2025-03-17 06:02:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:36,207 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 261 transitions. [2025-03-17 06:02:36,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 06:02:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 261 transitions. [2025-03-17 06:02:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:02:36,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:36,208 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:36,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:02:36,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:36,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:36,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1480265903, now seen corresponding path program 1 times [2025-03-17 06:02:36,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:36,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634213486] [2025-03-17 06:02:36,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:36,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:36,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:36,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:36,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:36,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:02:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854731118] [2025-03-17 06:02:36,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:36,341 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 06:02:36,343 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 06:02:36,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:36,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:36,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:36,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:36,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:02:36,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:36,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:36,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2025-03-17 06:02:36,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:36,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 12 [2025-03-17 06:02:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:36,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:36,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:36,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634213486] [2025-03-17 06:02:36,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:02:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854731118] [2025-03-17 06:02:36,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854731118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:36,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:36,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:36,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692585980] [2025-03-17 06:02:36,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:36,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:36,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:36,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:36,959 INFO L87 Difference]: Start difference. First operand 189 states and 261 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:38,032 INFO L93 Difference]: Finished difference Result 555 states and 767 transitions. [2025-03-17 06:02:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:02:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-17 06:02:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:38,036 INFO L225 Difference]: With dead ends: 555 [2025-03-17 06:02:38,036 INFO L226 Difference]: Without dead ends: 367 [2025-03-17 06:02:38,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:38,037 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 213 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:38,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 524 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:02:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-17 06:02:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 196. [2025-03-17 06:02:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 178 states have (on average 1.3426966292134832) internal successors, (239), 179 states have internal predecessors, (239), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:02:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 269 transitions. [2025-03-17 06:02:38,053 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 269 transitions. Word has length 104 [2025-03-17 06:02:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:38,053 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 269 transitions. [2025-03-17 06:02:38,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 269 transitions. [2025-03-17 06:02:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:02:38,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:38,055 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:38,063 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 06:02:38,255 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,SelfDestructingSolverStorable7 [2025-03-17 06:02:38,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:38,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -769014605, now seen corresponding path program 1 times [2025-03-17 06:02:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962691908] [2025-03-17 06:02:38,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:38,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:38,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:38,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:38,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:38,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:38,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962691908] [2025-03-17 06:02:38,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962691908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:38,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:38,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:38,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260303604] [2025-03-17 06:02:38,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:38,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:38,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:38,605 INFO L87 Difference]: Start difference. First operand 196 states and 269 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 06:02:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:38,881 INFO L93 Difference]: Finished difference Result 391 states and 537 transitions. [2025-03-17 06:02:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:38,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-03-17 06:02:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:38,884 INFO L225 Difference]: With dead ends: 391 [2025-03-17 06:02:38,884 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 06:02:38,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:02:38,884 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 218 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:38,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 191 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 06:02:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-17 06:02:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 178 states have (on average 1.3314606741573034) internal successors, (237), 179 states have internal predecessors, (237), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:02:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 267 transitions. [2025-03-17 06:02:38,899 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 267 transitions. Word has length 104 [2025-03-17 06:02:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:38,899 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 267 transitions. [2025-03-17 06:02:38,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-17 06:02:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 267 transitions. [2025-03-17 06:02:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:02:38,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:38,900 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:38,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:02:38,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:38,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash -787164206, now seen corresponding path program 1 times [2025-03-17 06:02:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133644503] [2025-03-17 06:02:38,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:38,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:38,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:38,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 06:02:40,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:40,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133644503] [2025-03-17 06:02:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133644503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:40,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453552072] [2025-03-17 06:02:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:40,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:40,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:40,153 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 06:02:40,154 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 06:02:40,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:40,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:40,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:40,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:40,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 06:02:40,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:40,513 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 19 treesize of output 1 [2025-03-17 06:02:40,517 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 19 treesize of output 1 [2025-03-17 06:02:40,521 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 19 treesize of output 1 [2025-03-17 06:02:40,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2025-03-17 06:02:40,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:40,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 06:02:40,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:40,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2025-03-17 06:02:40,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:40,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2025-03-17 06:02:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:40,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453552072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:40,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:40,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2025-03-17 06:02:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320974524] [2025-03-17 06:02:40,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:40,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:02:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:40,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:02:40,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:02:40,878 INFO L87 Difference]: Start difference. First operand 196 states and 267 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:41,688 INFO L93 Difference]: Finished difference Result 472 states and 643 transitions. [2025-03-17 06:02:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:02:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-17 06:02:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:41,692 INFO L225 Difference]: With dead ends: 472 [2025-03-17 06:02:41,692 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 06:02:41,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:02:41,693 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 95 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:41,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 461 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:02:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 06:02:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 211. [2025-03-17 06:02:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 193 states have (on average 1.3419689119170986) internal successors, (259), 194 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:02:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2025-03-17 06:02:41,707 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 104 [2025-03-17 06:02:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:41,707 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2025-03-17 06:02:41,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2025-03-17 06:02:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:02:41,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:41,709 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:41,718 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 06:02:41,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:41,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:41,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:41,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2140473903, now seen corresponding path program 1 times [2025-03-17 06:02:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:41,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401777136] [2025-03-17 06:02:41,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:41,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:41,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:41,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:41,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:41,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:02:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46335849] [2025-03-17 06:02:41,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:41,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:41,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:41,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:41,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:02:42,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:42,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:42,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:42,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:42,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 06:02:42,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:42,190 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 65 treesize of output 64 [2025-03-17 06:02:42,309 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 114 treesize of output 96 [2025-03-17 06:02:42,527 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 29 treesize of output 13 [2025-03-17 06:02:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:02:42,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:42,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:42,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401777136] [2025-03-17 06:02:42,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:02:42,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46335849] [2025-03-17 06:02:42,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46335849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:42,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:42,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951440260] [2025-03-17 06:02:42,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:42,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:02:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:42,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:02:42,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:42,583 INFO L87 Difference]: Start difference. First operand 211 states and 289 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:44,830 INFO L93 Difference]: Finished difference Result 733 states and 1006 transitions. [2025-03-17 06:02:44,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:02:44,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-03-17 06:02:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:44,833 INFO L225 Difference]: With dead ends: 733 [2025-03-17 06:02:44,833 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 06:02:44,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:02:44,834 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 226 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:44,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 479 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 06:02:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 06:02:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 288. [2025-03-17 06:02:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 258 states have (on average 1.3410852713178294) internal successors, (346), 259 states have internal predecessors, (346), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:02:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 398 transitions. [2025-03-17 06:02:44,854 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 398 transitions. Word has length 104 [2025-03-17 06:02:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:44,854 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 398 transitions. [2025-03-17 06:02:44,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 06:02:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 398 transitions. [2025-03-17 06:02:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:02:44,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:44,858 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:44,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:02:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:45,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:45,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash -531366574, now seen corresponding path program 1 times [2025-03-17 06:02:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679067420] [2025-03-17 06:02:45,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:45,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:02:45,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:02:45,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:45,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat