./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:56:51,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:56:51,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:56:51,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:56:51,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:56:51,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:56:51,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:56:51,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:56:51,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:56:51,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:56:51,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:56:51,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:56:51,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:56:51,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:56:51,654 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:56:51,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:56:51,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:56:51,656 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:56:51,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:56:51,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:56:51,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:56:51,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:56:51,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:51,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:56:51,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:56:51,657 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-jdk21/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 -> 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 [2025-02-06 03:56:51,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:56:51,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:56:51,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:56:51,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:56:51,898 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:56:51,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2025-02-06 03:56:53,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b0bab7f4/a93bbc21b36f4dce9ce2ab954178cd6b/FLAGccd8f3944 [2025-02-06 03:56:53,353 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:56:53,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2025-02-06 03:56:53,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b0bab7f4/a93bbc21b36f4dce9ce2ab954178cd6b/FLAGccd8f3944 [2025-02-06 03:56:53,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b0bab7f4/a93bbc21b36f4dce9ce2ab954178cd6b [2025-02-06 03:56:53,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:56:53,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:56:53,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:53,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:56:53,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:56:53,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53, skipping insertion in model container [2025-02-06 03:56:53,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:56:53,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i[916,929] [2025-02-06 03:56:53,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:53,566 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:56:53,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i[916,929] [2025-02-06 03:56:53,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:53,635 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:56:53,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53 WrapperNode [2025-02-06 03:56:53,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:53,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:53,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:56:53,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:56:53,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,689 INFO L138 Inliner]: procedures = 30, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 507 [2025-02-06 03:56:53,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:53,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:56:53,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:56:53,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:56:53,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,718 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:56:53,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:56:53,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:56:53,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:56:53,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:56:53,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (1/1) ... [2025-02-06 03:56:53,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:53,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:56:53,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:56:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:56:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:56:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:56:53,858 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:56:53,859 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:56:54,176 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem82#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise91#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~short104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite130#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~ite127#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1; [2025-02-06 03:56:54,227 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-06 03:56:54,227 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:56:54,242 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:56:54,243 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:56:54,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:54 BoogieIcfgContainer [2025-02-06 03:56:54,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:56:54,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:56:54,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:56:54,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:56:54,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:56:53" (1/3) ... [2025-02-06 03:56:54,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76616a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:54, skipping insertion in model container [2025-02-06 03:56:54,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:53" (2/3) ... [2025-02-06 03:56:54,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76616a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:54, skipping insertion in model container [2025-02-06 03:56:54,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:54" (3/3) ... [2025-02-06 03:56:54,252 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-82.i [2025-02-06 03:56:54,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:56:54,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-82.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:56:54,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:56:54,316 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;@6fe02314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:56:54,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:56:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:56:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:56:54,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:54,330 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:54,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:54,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash -552001258, now seen corresponding path program 1 times [2025-02-06 03:56:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:54,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596489237] [2025-02-06 03:56:54,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:54,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:54,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:54,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:54,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:56:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596489237] [2025-02-06 03:56:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596489237] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686041894] [2025-02-06 03:56:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:54,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:54,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:54,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:56:54,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:54,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:54,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:54,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:54,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:56:54,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:56:54,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686041894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:56:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038887335] [2025-02-06 03:56:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:54,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:56:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:56:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:56:54,893 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:56:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:54,913 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-02-06 03:56:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:56:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-02-06 03:56:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:54,919 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:56:54,919 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 03:56:54,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-02-06 03:56:54,923 INFO L435 NwaCegarLoop]: 155 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, 155 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-02-06 03:56:54,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 03:56:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 03:56:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:56:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2025-02-06 03:56:54,952 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 121 [2025-02-06 03:56:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:54,952 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2025-02-06 03:56:54,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:56:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2025-02-06 03:56:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:56:54,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:54,955 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:54,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:56:55,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:56:55,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:55,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1624965129, now seen corresponding path program 1 times [2025-02-06 03:56:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:55,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415080472] [2025-02-06 03:56:55,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:55,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:55,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:55,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:55,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:56:55,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:55,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415080472] [2025-02-06 03:56:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415080472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608491475] [2025-02-06 03:56:55,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:55,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:55,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:56:55,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:55,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:55,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:55,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:55,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:56:55,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:56:55,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608491475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:56:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247120985] [2025-02-06 03:56:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:55,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:55,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:55,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:55,804 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:55,838 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2025-02-06 03:56:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:56:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:55,840 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:56:55,840 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:56:55,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:55,841 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 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-02-06 03:56:55,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:56:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-02-06 03:56:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:56:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-02-06 03:56:55,848 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 121 [2025-02-06 03:56:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-02-06 03:56:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-02-06 03:56:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:56:55,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:55,850 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:55,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:56:56,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:56,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -182489334, now seen corresponding path program 1 times [2025-02-06 03:56:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078154244] [2025-02-06 03:56:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:56,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:56,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:56,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:56,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:56:56,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078154244] [2025-02-06 03:56:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078154244] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184848406] [2025-02-06 03:56:56,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:56,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:56,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:56,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:56,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:56:56,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:56,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:56,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:56,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:56,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:56:56,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:56:56,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184848406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:56,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:56,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:56:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338963225] [2025-02-06 03:56:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:56,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:56,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:56,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:56,498 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:56,535 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2025-02-06 03:56:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:56:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:56,536 INFO L225 Difference]: With dead ends: 226 [2025-02-06 03:56:56,536 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 03:56:56,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:56,537 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 446 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-02-06 03:56:56,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 446 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 03:56:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-02-06 03:56:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:56:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-02-06 03:56:56,544 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 121 [2025-02-06 03:56:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:56,545 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-02-06 03:56:56,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-02-06 03:56:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:56:56,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:56,547 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:56,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:56:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:56,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 705014347, now seen corresponding path program 1 times [2025-02-06 03:56:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:56,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956946438] [2025-02-06 03:56:56,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:56,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:56,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:56,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:56,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:56:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956946438] [2025-02-06 03:56:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956946438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827031823] [2025-02-06 03:56:56,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:56,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:56,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:56,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:56:57,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:57,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:57,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:57,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:57,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:56:57,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:56:57,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:57,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827031823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:57,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:57,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:56:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484780635] [2025-02-06 03:56:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:57,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:57,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:57,130 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:57,158 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2025-02-06 03:56:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:56:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:57,159 INFO L225 Difference]: With dead ends: 230 [2025-02-06 03:56:57,161 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:56:57,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:57,162 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 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-02-06 03:56:57,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:56:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-02-06 03:56:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:56:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2025-02-06 03:56:57,172 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 121 [2025-02-06 03:56:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:57,172 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2025-02-06 03:56:57,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2025-02-06 03:56:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:56:57,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:57,176 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:57,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:56:57,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:57,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:57,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash 705937868, now seen corresponding path program 1 times [2025-02-06 03:56:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183223153] [2025-02-06 03:56:57,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:57,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:57,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:57,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:56:57,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183223153] [2025-02-06 03:56:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183223153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683890982] [2025-02-06 03:56:57,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:57,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:57,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:57,541 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:57,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:56:57,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:56:57,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:56:57,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:57,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:57,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:56:57,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:56:57,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683890982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:57,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:56:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562525838] [2025-02-06 03:56:57,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:57,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:57,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:57,742 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:57,764 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2025-02-06 03:56:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:56:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:57,766 INFO L225 Difference]: With dead ends: 233 [2025-02-06 03:56:57,766 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:56:57,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:57,767 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:57,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:56:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 03:56:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:56:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-02-06 03:56:57,775 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 121 [2025-02-06 03:56:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:57,775 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-02-06 03:56:57,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-02-06 03:56:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:56:57,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:57,777 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:57,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:56:57,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:57,978 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:57,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1083529434, now seen corresponding path program 1 times [2025-02-06 03:56:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203366817] [2025-02-06 03:56:57,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:57,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:56:58,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:56:58,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:58,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:56:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203366817] [2025-02-06 03:56:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203366817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258787432] [2025-02-06 03:56:58,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:58,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:58,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:58,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:58,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:56:58,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:56:58,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:56:58,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:58,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:58,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:56:58,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:56:58,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258787432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:58,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:58,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 03:56:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214279453] [2025-02-06 03:56:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:58,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:58,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:58,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:58,404 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:58,467 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2025-02-06 03:56:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:58,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:56:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:58,469 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:56:58,470 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 03:56:58,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:58,471 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:58,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:56:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 03:56:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-02-06 03:56:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:56:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2025-02-06 03:56:58,479 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 123 [2025-02-06 03:56:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:58,482 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2025-02-06 03:56:58,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2025-02-06 03:56:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:56:58,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:58,483 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:58,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:56:58,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 03:56:58,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash 29482600, now seen corresponding path program 1 times [2025-02-06 03:56:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229353254] [2025-02-06 03:56:58,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:58,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:56:58,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:56:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:56:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229353254] [2025-02-06 03:56:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229353254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254449606] [2025-02-06 03:56:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:59,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:59,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:59,107 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:59,394 INFO L93 Difference]: Finished difference Result 353 states and 491 transitions. [2025-02-06 03:56:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:59,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-02-06 03:56:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:59,396 INFO L225 Difference]: With dead ends: 353 [2025-02-06 03:56:59,396 INFO L226 Difference]: Without dead ends: 236 [2025-02-06 03:56:59,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:59,397 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 136 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:59,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 545 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-06 03:56:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 170. [2025-02-06 03:56:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 139 states have internal predecessors, (181), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:56:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 237 transitions. [2025-02-06 03:56:59,405 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 237 transitions. Word has length 125 [2025-02-06 03:56:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:59,405 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 237 transitions. [2025-02-06 03:56:59,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 237 transitions. [2025-02-06 03:56:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:56:59,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:59,407 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:59,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:56:59,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:59,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash -13852180, now seen corresponding path program 1 times [2025-02-06 03:56:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-02-06 03:56:59,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:59,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:56:59,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:56:59,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:59,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:56:59,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-02-06 03:56:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496099465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:59,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:59,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:59,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129140599] [2025-02-06 03:56:59,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:59,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:59,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:59,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:59,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:59,577 INFO L87 Difference]: Start difference. First operand 170 states and 237 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:59,708 INFO L93 Difference]: Finished difference Result 282 states and 393 transitions. [2025-02-06 03:56:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:59,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-02-06 03:56:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:59,710 INFO L225 Difference]: With dead ends: 282 [2025-02-06 03:56:59,710 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 03:56:59,710 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-02-06 03:56:59,711 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:59,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:56:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 03:56:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-06 03:56:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 134 states have (on average 1.291044776119403) internal successors, (173), 134 states have internal predecessors, (173), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:56:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2025-02-06 03:56:59,720 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 125 [2025-02-06 03:56:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:59,720 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2025-02-06 03:56:59,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:56:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2025-02-06 03:56:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:56:59,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:59,721 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:59,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:56:59,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:59,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1893474036, now seen corresponding path program 1 times [2025-02-06 03:56:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:59,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905628468] [2025-02-06 03:56:59,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:59,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:56:59,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:56:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:00,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:57:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905628468] [2025-02-06 03:57:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905628468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:57:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506079907] [2025-02-06 03:57:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:00,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:57:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:57:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:57:00,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:57:00,917 INFO L87 Difference]: Start difference. First operand 165 states and 229 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:57:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:01,838 INFO L93 Difference]: Finished difference Result 366 states and 506 transitions. [2025-02-06 03:57:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:57:01,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2025-02-06 03:57:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:01,840 INFO L225 Difference]: With dead ends: 366 [2025-02-06 03:57:01,840 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 03:57:01,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:57:01,841 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 100 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:01,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1160 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:57:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 03:57:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2025-02-06 03:57:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 213 states have (on average 1.3145539906103287) internal successors, (280), 214 states have internal predecessors, (280), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:57:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 348 transitions. [2025-02-06 03:57:01,853 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 348 transitions. Word has length 126 [2025-02-06 03:57:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:01,853 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 348 transitions. [2025-02-06 03:57:01,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:57:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 348 transitions. [2025-02-06 03:57:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:57:01,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:01,854 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:01,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:57:01,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:01,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 435657232, now seen corresponding path program 1 times [2025-02-06 03:57:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:57:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983790807] [2025-02-06 03:57:01,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:57:01,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:57:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:57:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:57:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983790807] [2025-02-06 03:57:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983790807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:01,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:57:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725009201] [2025-02-06 03:57:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:57:01,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:57:01,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:57:01,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:57:01,993 INFO L87 Difference]: Start difference. First operand 251 states and 348 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:02,175 INFO L93 Difference]: Finished difference Result 569 states and 786 transitions. [2025-02-06 03:57:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:57:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-02-06 03:57:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:02,179 INFO L225 Difference]: With dead ends: 569 [2025-02-06 03:57:02,181 INFO L226 Difference]: Without dead ends: 371 [2025-02-06 03:57:02,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:57:02,182 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 70 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:02,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 739 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:57:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-06 03:57:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 305. [2025-02-06 03:57:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 267 states have (on average 1.3408239700374531) internal successors, (358), 268 states have internal predecessors, (358), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:57:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 426 transitions. [2025-02-06 03:57:02,205 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 426 transitions. Word has length 126 [2025-02-06 03:57:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 426 transitions. [2025-02-06 03:57:02,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 426 transitions. [2025-02-06 03:57:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:57:02,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:02,207 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:02,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:57:02,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2049611665, now seen corresponding path program 1 times [2025-02-06 03:57:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:57:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040124621] [2025-02-06 03:57:02,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:57:02,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:57:02,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:57:02,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:02,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:57:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040124621] [2025-02-06 03:57:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040124621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:02,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:57:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327525673] [2025-02-06 03:57:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:02,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:57:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:57:02,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:57:02,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:57:02,290 INFO L87 Difference]: Start difference. First operand 305 states and 426 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:02,350 INFO L93 Difference]: Finished difference Result 669 states and 929 transitions. [2025-02-06 03:57:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:57:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-02-06 03:57:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:02,354 INFO L225 Difference]: With dead ends: 669 [2025-02-06 03:57:02,354 INFO L226 Difference]: Without dead ends: 419 [2025-02-06 03:57:02,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:57:02,356 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 68 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:02,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 358 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:57:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-06 03:57:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 351. [2025-02-06 03:57:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 313 states have (on average 1.34185303514377) internal successors, (420), 314 states have internal predecessors, (420), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:57:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 488 transitions. [2025-02-06 03:57:02,376 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 488 transitions. Word has length 127 [2025-02-06 03:57:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:02,376 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 488 transitions. [2025-02-06 03:57:02,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 488 transitions. [2025-02-06 03:57:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:57:02,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:02,378 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:02,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:57:02,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:02,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1332918790, now seen corresponding path program 1 times [2025-02-06 03:57:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:57:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544242531] [2025-02-06 03:57:02,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:57:02,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:57:02,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:57:02,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:02,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:57:02,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:57:02,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:57:02,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:57:02,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:02,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:57:02,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:57:02,642 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:57:02,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:57:02,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:57:02,646 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:57:02,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:57:02,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:57:02 BoogieIcfgContainer [2025-02-06 03:57:02,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:57:02,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:57:02,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:57:02,716 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:57:02,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:54" (3/4) ... [2025-02-06 03:57:02,718 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:57:02,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:57:02,719 INFO L158 Benchmark]: Toolchain (without parser) took 9336.08ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 111.3MB in the beginning and 373.3MB in the end (delta: -262.0MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2025-02-06 03:57:02,719 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:57:02,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.90ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 94.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:57:02,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.07ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 89.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:57:02,719 INFO L158 Benchmark]: Boogie Preprocessor took 55.62ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 86.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:57:02,719 INFO L158 Benchmark]: IcfgBuilder took 489.74ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 49.7MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:57:02,719 INFO L158 Benchmark]: TraceAbstraction took 8468.91ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 49.7MB in the beginning and 373.4MB in the end (delta: -323.7MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. [2025-02-06 03:57:02,720 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 436.2MB. Free memory was 373.4MB in the beginning and 373.3MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:57:02,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.90ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 94.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.07ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 89.9MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.62ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 86.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 489.74ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 49.7MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8468.91ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 49.7MB in the beginning and 373.4MB in the end (delta: -323.7MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 436.2MB. Free memory was 373.4MB in the beginning and 373.3MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L55] unsigned char last_1_WrapperStruct00_var_1_5 = 32; [L56] unsigned char last_1_WrapperStruct00_var_1_12 = 2; [L57] unsigned char last_1_WrapperStruct00_var_1_17 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L113] EXPR WrapperStruct00.var_1_5 [L113] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L114] EXPR WrapperStruct00.var_1_12 [L114] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L115] EXPR WrapperStruct00.var_1_17 [L115] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L126] RET updateVariables() [L127] CALL step() [L61] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L61] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12; [L62] COND FALSE !((last_1_WrapperStruct00_var_1_5 / -2) >= stepLocal_0) [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L65] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L65] EXPR WrapperStruct00.var_1_11 [L65] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L65] WrapperStruct00.var_1_5 = (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) [L67] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L67] COND FALSE !(! WrapperStruct00.var_1_2) [L72] EXPR WrapperStruct00.var_1_4 [L72] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_4 [L73] EXPR WrapperStruct00.var_1_9 [L73] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_9 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_3 [L75] EXPR WrapperStruct00.var_1_9 [L75] unsigned char stepLocal_1 = WrapperStruct00.var_1_9; [L76] EXPR WrapperStruct00.var_1_5 [L76] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32, stepLocal_1=-2] [L76] COND FALSE !((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= stepLocal_1) [L85] EXPR WrapperStruct00.var_1_9 [L85] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_9 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_10 [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9))) [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)) [L118] EXPR WrapperStruct00.var_1_12 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4)) [L118] EXPR WrapperStruct00.var_1_16 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9)) [L118] EXPR WrapperStruct00.var_1_17 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR (((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) [L118] EXPR WrapperStruct00.var_1_18 [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118-L119] return ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 5708 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4011 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1422 IncrementalHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1697 mSDtfsCounter, 1422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=11, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 208 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2213 NumberOfCodeBlocks, 2213 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2068 ConstructedInterpolants, 0 QuantifiedInterpolants, 2976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2731 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 5967/6188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:57:02,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:57:04,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:57:04,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:57:04,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:57:04,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:57:04,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:57:04,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:57:04,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:57:04,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:57:04,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:57:04,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:57:04,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:57:04,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:57:04,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:57:04,800 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:57:04,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:57:04,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:57:04,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:57:04,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:57:04,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:57:04,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:57:04,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:57:04,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:57:04,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:57:04,801 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:57:04,801 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:57:04,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:57:04,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:57:04,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:57:04,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:57:04,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:57:04,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:57:04,803 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:57:04,803 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:57:04,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:57:04,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:57:04,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:57:04,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:57:04,803 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-jdk21/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 -> 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 [2025-02-06 03:57:05,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:57:05,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:57:05,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:57:05,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:57:05,063 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:57:05,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2025-02-06 03:57:06,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c63e26713/bee850844824434383f8ba14a20ba1d1/FLAGca8a29a75 [2025-02-06 03:57:06,461 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:57:06,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2025-02-06 03:57:06,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c63e26713/bee850844824434383f8ba14a20ba1d1/FLAGca8a29a75 [2025-02-06 03:57:06,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c63e26713/bee850844824434383f8ba14a20ba1d1 [2025-02-06 03:57:06,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:57:06,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:57:06,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:57:06,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:57:06,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:57:06,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:57:06" (1/1) ... [2025-02-06 03:57:06,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7ac95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:06, skipping insertion in model container [2025-02-06 03:57:06,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:57:06" (1/1) ... [2025-02-06 03:57:06,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:57:06,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i[916,929] [2025-02-06 03:57:06,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:57:07,011 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:57:07,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i[916,929] [2025-02-06 03:57:07,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:57:07,084 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:57:07,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07 WrapperNode [2025-02-06 03:57:07,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:57:07,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:57:07,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:57:07,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:57:07,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,134 INFO L138 Inliner]: procedures = 34, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2025-02-06 03:57:07,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:57:07,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:57:07,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:57:07,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:57:07,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,165 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-02-06 03:57:07,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,178 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:57:07,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:57:07,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:57:07,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:57:07,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (1/1) ... [2025-02-06 03:57:07,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:57:07,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:57:07,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:57:07,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:57:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:57:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:57:07,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:57:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:57:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:57:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:57:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:57:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:57:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:57:07,337 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:57:07,339 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:57:09,871 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem80#1;havoc property_#t~ite89#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite101#1;havoc property_#t~mem94#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite128#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~ite125#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short132#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1; [2025-02-06 03:57:09,893 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-02-06 03:57:09,893 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:57:09,907 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:57:09,907 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:57:09,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:57:09 BoogieIcfgContainer [2025-02-06 03:57:09,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:57:09,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:57:09,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:57:09,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:57:09,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:57:06" (1/3) ... [2025-02-06 03:57:09,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da35cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:57:09, skipping insertion in model container [2025-02-06 03:57:09,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:57:07" (2/3) ... [2025-02-06 03:57:09,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da35cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:57:09, skipping insertion in model container [2025-02-06 03:57:09,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:57:09" (3/3) ... [2025-02-06 03:57:09,913 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-82.i [2025-02-06 03:57:09,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:57:09,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-82.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:57:09,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:57:09,968 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;@e99321c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:57:09,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:57:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:57:09,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:09,983 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:09,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:09,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1738834489, now seen corresponding path program 1 times [2025-02-06 03:57:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:09,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950568743] [2025-02-06 03:57:09,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:09,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:09,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:10,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:57:10,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:57:10,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:57:10,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:10,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:10,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:57:10,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-02-06 03:57:10,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:10,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950568743] [2025-02-06 03:57:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950568743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:57:10,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747799317] [2025-02-06 03:57:10,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:10,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:57:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:57:10,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:57:10,266 INFO L87 Difference]: Start difference. First operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:57:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:10,283 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2025-02-06 03:57:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:57:10,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-02-06 03:57:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:10,289 INFO L225 Difference]: With dead ends: 208 [2025-02-06 03:57:10,289 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:57:10,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-02-06 03:57:10,293 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:10,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:57:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:57:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-06 03:57:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-02-06 03:57:10,318 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 119 [2025-02-06 03:57:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:10,318 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-02-06 03:57:10,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:57:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-02-06 03:57:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:57:10,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:10,322 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:10,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:57:10,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:10,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:10,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1304584634, now seen corresponding path program 1 times [2025-02-06 03:57:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547817752] [2025-02-06 03:57:10,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:10,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:10,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:10,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:10,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:57:10,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:57:10,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:57:10,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:10,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:10,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:57:10,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:10,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:10,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:10,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547817752] [2025-02-06 03:57:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547817752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:57:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266402783] [2025-02-06 03:57:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:10,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:57:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:10,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:57:10,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:57:10,807 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:10,852 INFO L93 Difference]: Finished difference Result 207 states and 292 transitions. [2025-02-06 03:57:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:57:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-02-06 03:57:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:10,856 INFO L225 Difference]: With dead ends: 207 [2025-02-06 03:57:10,856 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:57:10,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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-02-06 03:57:10,857 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:10,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:57:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:57:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 03:57:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2025-02-06 03:57:10,871 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 119 [2025-02-06 03:57:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:10,874 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2025-02-06 03:57:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2025-02-06 03:57:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:57:10,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:10,876 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:10,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:57:11,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:11,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:11,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1686290068, now seen corresponding path program 1 times [2025-02-06 03:57:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815616843] [2025-02-06 03:57:11,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:11,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:11,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:11,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:11,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:57:11,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:57:11,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:57:11,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:11,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:11,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:57:11,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:11,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:11,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815616843] [2025-02-06 03:57:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815616843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:57:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563215082] [2025-02-06 03:57:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:11,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:57:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:11,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:57:11,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:57:11,370 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:11,419 INFO L93 Difference]: Finished difference Result 212 states and 297 transitions. [2025-02-06 03:57:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:57:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:57:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:11,420 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:57:11,421 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:57:11,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:57:11,422 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:11,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:57:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:57:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-02-06 03:57:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2025-02-06 03:57:11,427 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 121 [2025-02-06 03:57:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:11,428 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2025-02-06 03:57:11,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2025-02-06 03:57:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:57:11,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:11,429 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:11,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:57:11,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:11,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:11,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1942195542, now seen corresponding path program 1 times [2025-02-06 03:57:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027786612] [2025-02-06 03:57:11,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:11,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:11,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:57:11,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:57:11,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:57:11,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:11,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:11,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:57:11,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:11,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:11,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027786612] [2025-02-06 03:57:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027786612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:57:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558712875] [2025-02-06 03:57:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:57:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:11,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:57:11,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:57:11,916 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:14,468 INFO L93 Difference]: Finished difference Result 206 states and 288 transitions. [2025-02-06 03:57:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:57:14,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:57:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:14,470 INFO L225 Difference]: With dead ends: 206 [2025-02-06 03:57:14,470 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 03:57:14,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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-02-06 03:57:14,476 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:14,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 03:57:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 03:57:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-06 03:57:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2025-02-06 03:57:14,485 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 123 [2025-02-06 03:57:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:14,488 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2025-02-06 03:57:14,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2025-02-06 03:57:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:57:14,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:14,490 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:14,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:57:14,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:14,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:14,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1667005417, now seen corresponding path program 1 times [2025-02-06 03:57:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:14,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974187726] [2025-02-06 03:57:14,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:14,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:14,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:14,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:57:14,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:57:14,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:57:14,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:14,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:14,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:57:14,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:14,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:14,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974187726] [2025-02-06 03:57:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974187726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:57:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105463280] [2025-02-06 03:57:14,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:14,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:57:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:14,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:57:14,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:57:14,898 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:14,950 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2025-02-06 03:57:14,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:57:14,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:57:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:14,952 INFO L225 Difference]: With dead ends: 204 [2025-02-06 03:57:14,952 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 03:57:14,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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-02-06 03:57:14,953 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:14,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:57:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 03:57:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-02-06 03:57:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2025-02-06 03:57:14,958 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 123 [2025-02-06 03:57:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:14,958 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2025-02-06 03:57:14,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2025-02-06 03:57:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:57:14,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:14,960 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:14,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:57:15,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:15,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:15,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash 820507416, now seen corresponding path program 1 times [2025-02-06 03:57:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:15,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102751292] [2025-02-06 03:57:15,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:15,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:15,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:15,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:57:15,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:57:15,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:57:15,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:15,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:15,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:57:15,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:15,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:15,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102751292] [2025-02-06 03:57:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102751292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:15,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:15,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:57:15,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146705870] [2025-02-06 03:57:15,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:15,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:57:15,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:15,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:57:15,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:57:15,369 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:15,441 INFO L93 Difference]: Finished difference Result 208 states and 287 transitions. [2025-02-06 03:57:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:57:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:57:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:15,443 INFO L225 Difference]: With dead ends: 208 [2025-02-06 03:57:15,443 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 03:57:15,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:57:15,444 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:15,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 529 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:57:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 03:57:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-02-06 03:57:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2025-02-06 03:57:15,448 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 123 [2025-02-06 03:57:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:15,449 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2025-02-06 03:57:15,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2025-02-06 03:57:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:57:15,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:15,450 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:15,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:57:15,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:15,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:15,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1708011097, now seen corresponding path program 1 times [2025-02-06 03:57:15,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:15,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111458984] [2025-02-06 03:57:15,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:15,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:15,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:15,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:15,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:57:15,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:57:15,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:57:15,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:15,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:57:15,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:15,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:15,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:15,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111458984] [2025-02-06 03:57:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111458984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:15,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:57:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661118929] [2025-02-06 03:57:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:15,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:57:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:15,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:57:15,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:57:15,846 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:15,993 INFO L93 Difference]: Finished difference Result 212 states and 291 transitions. [2025-02-06 03:57:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:57:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:57:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:15,995 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:57:15,995 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:57:15,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:57:15,996 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:15,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 655 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:57:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:57:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-02-06 03:57:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:57:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2025-02-06 03:57:16,005 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 123 [2025-02-06 03:57:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2025-02-06 03:57:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2025-02-06 03:57:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:57:16,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:16,007 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:16,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:57:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:16,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1708934618, now seen corresponding path program 1 times [2025-02-06 03:57:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001372147] [2025-02-06 03:57:16,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:16,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:16,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:16,212 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:16,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:57:16,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:57:16,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:57:16,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:16,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:16,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:57:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:16,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:57:16,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2025-02-06 03:57:16,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:16,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 101 treesize of output 41 [2025-02-06 03:57:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:16,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:16,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001372147] [2025-02-06 03:57:16,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001372147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:16,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:16,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:57:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397345290] [2025-02-06 03:57:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:16,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:57:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:16,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:57:16,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:57:16,864 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:20,111 INFO L93 Difference]: Finished difference Result 319 states and 435 transitions. [2025-02-06 03:57:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:57:20,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:57:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:20,114 INFO L225 Difference]: With dead ends: 319 [2025-02-06 03:57:20,114 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 03:57:20,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:57:20,115 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:20,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 423 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 03:57:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 03:57:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2025-02-06 03:57:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 148 states have internal predecessors, (190), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:57:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2025-02-06 03:57:20,143 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 123 [2025-02-06 03:57:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2025-02-06 03:57:20,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2025-02-06 03:57:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:57:20,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:20,145 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:20,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:57:20,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:20,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:20,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash -663531430, now seen corresponding path program 1 times [2025-02-06 03:57:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:20,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109083532] [2025-02-06 03:57:20,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:20,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:20,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:20,352 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:20,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:57:20,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:57:20,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:57:20,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:20,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:20,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 03:57:20,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:20,686 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 14 treesize of output 10 [2025-02-06 03:57:20,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2025-02-06 03:57:21,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:21,151 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 62 treesize of output 37 [2025-02-06 03:57:21,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:21,345 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 62 treesize of output 37 [2025-02-06 03:57:21,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:21,670 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 77 treesize of output 55 [2025-02-06 03:57:21,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 28 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 64 [2025-02-06 03:57:21,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:21,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 78 [2025-02-06 03:57:22,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:22,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 55 [2025-02-06 03:57:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 249 proven. 30 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-02-06 03:57:22,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:57:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:57:23,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109083532] [2025-02-06 03:57:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109083532] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:57:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:57:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 30 [2025-02-06 03:57:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010473095] [2025-02-06 03:57:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:23,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:57:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:23,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:57:23,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:57:23,283 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:34,347 INFO L93 Difference]: Finished difference Result 448 states and 607 transitions. [2025-02-06 03:57:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:57:34,350 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:57:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:34,352 INFO L225 Difference]: With dead ends: 448 [2025-02-06 03:57:34,352 INFO L226 Difference]: Without dead ends: 343 [2025-02-06 03:57:34,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:57:34,353 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 245 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:34,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1039 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2025-02-06 03:57:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-06 03:57:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 279. [2025-02-06 03:57:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 240 states have (on average 1.2958333333333334) internal successors, (311), 241 states have internal predecessors, (311), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:57:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 379 transitions. [2025-02-06 03:57:34,365 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 379 transitions. Word has length 123 [2025-02-06 03:57:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:34,365 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 379 transitions. [2025-02-06 03:57:34,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:57:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 379 transitions. [2025-02-06 03:57:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:57:34,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:34,366 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:34,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:57:34,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:34,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:34,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash -474080696, now seen corresponding path program 1 times [2025-02-06 03:57:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828367563] [2025-02-06 03:57:34,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:34,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:34,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:34,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:34,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:57:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:57:34,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:57:34,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:34,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:34,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 03:57:34,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:34,903 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-02-06 03:57:35,200 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 80 treesize of output 34 [2025-02-06 03:57:35,320 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 75 treesize of output 44 [2025-02-06 03:57:35,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:35,548 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 85 treesize of output 57 [2025-02-06 03:57:35,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:35,836 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 100 treesize of output 60 [2025-02-06 03:57:36,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:36,078 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 95 treesize of output 70 [2025-02-06 03:57:36,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:36,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 73 [2025-02-06 03:57:36,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:36,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 73 [2025-02-06 03:57:36,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:36,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 110 [2025-02-06 03:57:37,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:37,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 116 [2025-02-06 03:57:40,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:40,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 307 treesize of output 115 [2025-02-06 03:57:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 03:57:41,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:41,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:41,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828367563] [2025-02-06 03:57:41,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828367563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:41,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:41,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:57:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554563959] [2025-02-06 03:57:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:41,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:57:41,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:41,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:57:41,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:57:41,099 INFO L87 Difference]: Start difference. First operand 279 states and 379 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:57:46,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:57:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:57:54,969 INFO L93 Difference]: Finished difference Result 580 states and 765 transitions. [2025-02-06 03:57:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:57:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-02-06 03:57:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:57:54,974 INFO L225 Difference]: With dead ends: 580 [2025-02-06 03:57:54,974 INFO L226 Difference]: Without dead ends: 578 [2025-02-06 03:57:54,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:57:54,975 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 345 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:57:54,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 632 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2025-02-06 03:57:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-06 03:57:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 554. [2025-02-06 03:57:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 477 states have (on average 1.278825995807128) internal successors, (610), 480 states have internal predecessors, (610), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:57:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 734 transitions. [2025-02-06 03:57:54,998 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 734 transitions. Word has length 125 [2025-02-06 03:57:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:57:54,999 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 734 transitions. [2025-02-06 03:57:54,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-06 03:57:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 734 transitions. [2025-02-06 03:57:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:57:55,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:57:55,000 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:57:55,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:57:55,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:55,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:57:55,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:57:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash -473157175, now seen corresponding path program 1 times [2025-02-06 03:57:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:57:55,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234902623] [2025-02-06 03:57:55,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:57:55,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:57:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:57:55,209 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:57:55,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:57:55,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:57:55,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:57:55,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:57:55,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:57:55,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:57:55,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:57:55,507 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 8 treesize of output 1 [2025-02-06 03:57:55,510 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 14 treesize of output 10 [2025-02-06 03:57:55,551 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 25 treesize of output 24 [2025-02-06 03:57:55,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:55,636 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 40 treesize of output 27 [2025-02-06 03:57:55,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:55,713 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 40 treesize of output 27 [2025-02-06 03:57:55,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:55,809 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 40 treesize of output 27 [2025-02-06 03:57:55,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:55,845 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 76 treesize of output 67 [2025-02-06 03:57:55,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:55,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 87 [2025-02-06 03:57:56,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:57:56,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 120 treesize of output 48 [2025-02-06 03:57:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:57:56,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:57:56,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:57:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234902623] [2025-02-06 03:57:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234902623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:57:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:57:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:57:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054982212] [2025-02-06 03:57:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:57:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:57:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:57:56,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:57:56,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:57:56,493 INFO L87 Difference]: Start difference. First operand 554 states and 734 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:58:01,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:58:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:03,765 INFO L93 Difference]: Finished difference Result 1201 states and 1582 transitions. [2025-02-06 03:58:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:58:03,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-02-06 03:58:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:03,775 INFO L225 Difference]: With dead ends: 1201 [2025-02-06 03:58:03,775 INFO L226 Difference]: Without dead ends: 807 [2025-02-06 03:58:03,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:58:03,776 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 335 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:03,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 460 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-02-06 03:58:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-02-06 03:58:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 616. [2025-02-06 03:58:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 537 states have (on average 1.2625698324022345) internal successors, (678), 540 states have internal predecessors, (678), 62 states have call successors, (62), 16 states have call predecessors, (62), 16 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:58:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 802 transitions. [2025-02-06 03:58:03,818 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 802 transitions. Word has length 125 [2025-02-06 03:58:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:03,818 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 802 transitions. [2025-02-06 03:58:03,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:58:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 802 transitions. [2025-02-06 03:58:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:58:03,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:03,819 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:58:03,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 03:58:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:58:04,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:04,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 414346506, now seen corresponding path program 1 times [2025-02-06 03:58:04,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:58:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518874176] [2025-02-06 03:58:04,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:04,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:58:04,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:58:04,022 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:58:04,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:58:04,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:58:04,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:58:04,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:04,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:04,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 03:58:04,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:04,385 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-02-06 03:58:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-02-06 03:58:04,817 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 75 treesize of output 44 [2025-02-06 03:58:05,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:05,084 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 90 treesize of output 47 [2025-02-06 03:58:05,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:05,294 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 90 treesize of output 47 [2025-02-06 03:58:05,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:05,511 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 85 treesize of output 57 [2025-02-06 03:58:05,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:05,983 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 100 treesize of output 60 [2025-02-06 03:58:06,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:06,060 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 164 treesize of output 107 [2025-02-06 03:58:06,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:06,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 116 [2025-02-06 03:58:09,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:09,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 307 treesize of output 115 [2025-02-06 03:58:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-06 03:58:09,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:58:09,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:58:09,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518874176] [2025-02-06 03:58:09,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518874176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:09,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:09,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:58:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976928757] [2025-02-06 03:58:09,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:09,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:58:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:58:09,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:58:09,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:58:09,775 INFO L87 Difference]: Start difference. First operand 616 states and 802 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:58:17,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:58:21,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:58:23,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]