./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:23:26,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:23:26,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:23:26,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:23:26,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:23:26,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:23:26,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:23:26,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:23:26,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:23:26,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:23:26,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:23:26,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:23:26,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:23:26,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:23:26,560 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:23:26,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:23:26,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:23:26,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:23:26,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:23:26,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:26,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:23:26,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:23:26,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2025-03-17 05:23:26,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:23:26,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:23:26,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:23:26,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:23:26,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:23:26,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-03-17 05:23:27,964 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0840424e/f337c29efd164c42a2aac07d27a0f8af/FLAG18c052ab1 [2025-03-17 05:23:28,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:23:28,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-03-17 05:23:28,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0840424e/f337c29efd164c42a2aac07d27a0f8af/FLAG18c052ab1 [2025-03-17 05:23:28,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0840424e/f337c29efd164c42a2aac07d27a0f8af [2025-03-17 05:23:28,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:23:28,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:23:28,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:28,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:23:28,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:23:28,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577761b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28, skipping insertion in model container [2025-03-17 05:23:28,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:23:28,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-03-17 05:23:28,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:28,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:23:28,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-03-17 05:23:28,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:28,777 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:23:28,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28 WrapperNode [2025-03-17 05:23:28,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:28,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:28,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:23:28,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:23:28,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,834 INFO L138 Inliner]: procedures = 29, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2025-03-17 05:23:28,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:28,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:23:28,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:23:28,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:23:28,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,873 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2025-03-17 05:23:28,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:23:28,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:23:28,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:23:28,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:23:28,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (1/1) ... [2025-03-17 05:23:28,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:28,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:28,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:23:28,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:23:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:23:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:23:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:23:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:23:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:23:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:23:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:23:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:23:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:23:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:23:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:23:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:23:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:23:28,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:23:29,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:23:29,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:23:29,415 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-03-17 05:23:29,458 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-17 05:23:29,458 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:23:29,472 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:23:29,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:23:29,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:29 BoogieIcfgContainer [2025-03-17 05:23:29,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:23:29,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:23:29,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:23:29,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:23:29,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:23:28" (1/3) ... [2025-03-17 05:23:29,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84c6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:29, skipping insertion in model container [2025-03-17 05:23:29,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:28" (2/3) ... [2025-03-17 05:23:29,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84c6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:29, skipping insertion in model container [2025-03-17 05:23:29,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:29" (3/3) ... [2025-03-17 05:23:29,481 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2025-03-17 05:23:29,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:23:29,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-42.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:23:29,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:23:29,548 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;@727ed44c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:23:29,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:23:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:29,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:29,561 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:29,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:29,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1630584443, now seen corresponding path program 1 times [2025-03-17 05:23:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244320088] [2025-03-17 05:23:29,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:29,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:29,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:29,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:29,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:23:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244320088] [2025-03-17 05:23:29,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244320088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124089251] [2025-03-17 05:23:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:29,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:23:29,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:23:29,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:29,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:29,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:29,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:29,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:23:29,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:23:29,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124089251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:30,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:23:30,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:23:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700872361] [2025-03-17 05:23:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:30,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:23:30,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:30,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:23:30,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:30,018 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:30,033 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2025-03-17 05:23:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:23:30,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:23:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:30,039 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:23:30,039 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:23:30,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:30,045 INFO L435 NwaCegarLoop]: 131 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, 131 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-03-17 05:23:30,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:23:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:23:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2025-03-17 05:23:30,073 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2025-03-17 05:23:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:30,074 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2025-03-17 05:23:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2025-03-17 05:23:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:30,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:30,076 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:30,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:23:30,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:23:30,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1777071264, now seen corresponding path program 1 times [2025-03-17 05:23:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:30,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838905074] [2025-03-17 05:23:30,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:30,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:30,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:30,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:30,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:30,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:30,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838905074] [2025-03-17 05:23:30,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838905074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:30,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:30,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053384367] [2025-03-17 05:23:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:30,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:30,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:30,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:30,728 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:30,775 INFO L93 Difference]: Finished difference Result 183 states and 261 transitions. [2025-03-17 05:23:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:30,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:30,777 INFO L225 Difference]: With dead ends: 183 [2025-03-17 05:23:30,777 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:23:30,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:30,777 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:30,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:23:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:23:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2025-03-17 05:23:30,791 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 99 [2025-03-17 05:23:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:30,792 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2025-03-17 05:23:30,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2025-03-17 05:23:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:30,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:30,795 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:30,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:23:30,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:30,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 440686689, now seen corresponding path program 1 times [2025-03-17 05:23:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437167805] [2025-03-17 05:23:30,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:30,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:30,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:30,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:31,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437167805] [2025-03-17 05:23:31,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437167805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:31,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:31,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:31,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816474007] [2025-03-17 05:23:31,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:31,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:31,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:31,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:31,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:31,105 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:31,155 INFO L93 Difference]: Finished difference Result 181 states and 256 transitions. [2025-03-17 05:23:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:31,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:31,157 INFO L225 Difference]: With dead ends: 181 [2025-03-17 05:23:31,157 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 05:23:31,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:31,160 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:31,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 05:23:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 05:23:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-03-17 05:23:31,165 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 99 [2025-03-17 05:23:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:31,166 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-03-17 05:23:31,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-03-17 05:23:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:31,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:31,167 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:31,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:23:31,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:31,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:31,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1019919899, now seen corresponding path program 1 times [2025-03-17 05:23:31,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:31,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880650642] [2025-03-17 05:23:31,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:31,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:31,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:31,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:31,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:31,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:31,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880650642] [2025-03-17 05:23:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880650642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:31,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:23:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652714472] [2025-03-17 05:23:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:31,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:23:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:31,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:23:31,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:23:31,355 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:31,365 INFO L93 Difference]: Finished difference Result 177 states and 249 transitions. [2025-03-17 05:23:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:23:31,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:31,368 INFO L225 Difference]: With dead ends: 177 [2025-03-17 05:23:31,368 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:23:31,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:23:31,369 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:31,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:23:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:23:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-17 05:23:31,380 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 99 [2025-03-17 05:23:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:31,380 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-17 05:23:31,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-17 05:23:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:31,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:31,385 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:31,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:23:31,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:31,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1194438880, now seen corresponding path program 1 times [2025-03-17 05:23:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966731459] [2025-03-17 05:23:31,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:31,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:31,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:31,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:31,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966731459] [2025-03-17 05:23:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966731459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:31,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691091058] [2025-03-17 05:23:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:31,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:31,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:31,747 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:31,788 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2025-03-17 05:23:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:31,790 INFO L225 Difference]: With dead ends: 175 [2025-03-17 05:23:31,790 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:23:31,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:31,792 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:31,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:23:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:23:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-03-17 05:23:31,799 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 99 [2025-03-17 05:23:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:31,803 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-03-17 05:23:31,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-03-17 05:23:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:31,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:31,804 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:31,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:23:31,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:31,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash -882770463, now seen corresponding path program 1 times [2025-03-17 05:23:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019411993] [2025-03-17 05:23:31,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:31,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:31,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:31,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:31,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:32,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:32,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019411993] [2025-03-17 05:23:32,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019411993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:32,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:32,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688446480] [2025-03-17 05:23:32,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:32,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:32,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:32,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:32,174 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:32,210 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2025-03-17 05:23:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:32,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:32,212 INFO L225 Difference]: With dead ends: 175 [2025-03-17 05:23:32,213 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:23:32,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:32,215 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:32,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:23:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:23:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2025-03-17 05:23:32,224 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 99 [2025-03-17 05:23:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:32,224 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2025-03-17 05:23:32,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2025-03-17 05:23:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:32,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:32,226 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:23:32,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1388329088, now seen corresponding path program 1 times [2025-03-17 05:23:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006445595] [2025-03-17 05:23:32,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:32,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:32,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:32,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:32,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006445595] [2025-03-17 05:23:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006445595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:32,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:32,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:23:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434390758] [2025-03-17 05:23:32,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:32,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:32,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:32,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:32,761 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:32,894 INFO L93 Difference]: Finished difference Result 205 states and 283 transitions. [2025-03-17 05:23:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:32,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:32,895 INFO L225 Difference]: With dead ends: 205 [2025-03-17 05:23:32,895 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:23:32,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:23:32,896 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 98 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:32,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 587 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:23:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 05:23:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 95 states have internal predecessors, (121), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:23:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 161 transitions. [2025-03-17 05:23:32,906 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 161 transitions. Word has length 99 [2025-03-17 05:23:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:32,906 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 161 transitions. [2025-03-17 05:23:32,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2025-03-17 05:23:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:32,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:32,910 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:32,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:23:32,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:32,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1109686849, now seen corresponding path program 1 times [2025-03-17 05:23:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:32,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730770615] [2025-03-17 05:23:32,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:32,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:32,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:32,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:32,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:23:33,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730770615] [2025-03-17 05:23:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730770615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975772634] [2025-03-17 05:23:33,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:33,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:33,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:33,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:23:33,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:23:33,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:33,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:33,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:33,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:23:33,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:33,646 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 31 treesize of output 15 [2025-03-17 05:23:33,684 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 31 treesize of output 15 [2025-03-17 05:23:33,716 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 31 treesize of output 15 [2025-03-17 05:23:33,819 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-03-17 05:23:33,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:33,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2025-03-17 05:23:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 05:23:33,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:23:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975772634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:23:34,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:23:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 11 [2025-03-17 05:23:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758670093] [2025-03-17 05:23:34,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:34,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:23:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:34,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:23:34,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:34,114 INFO L87 Difference]: Start difference. First operand 117 states and 161 transitions. Second operand has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 05:23:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:34,392 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2025-03-17 05:23:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:23:34,392 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 99 [2025-03-17 05:23:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:34,395 INFO L225 Difference]: With dead ends: 275 [2025-03-17 05:23:34,395 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 05:23:34,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:23:34,397 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 313 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:34,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 451 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 05:23:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 125. [2025-03-17 05:23:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.26) internal successors, (126), 101 states have internal predecessors, (126), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:23:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2025-03-17 05:23:34,416 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 99 [2025-03-17 05:23:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:34,417 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2025-03-17 05:23:34,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 05:23:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2025-03-17 05:23:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:34,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:34,417 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:34,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:23:34,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 05:23:34,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:34,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash -316255316, now seen corresponding path program 1 times [2025-03-17 05:23:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:34,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110345047] [2025-03-17 05:23:34,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:34,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:34,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:34,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:34,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:34,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:35,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:35,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110345047] [2025-03-17 05:23:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110345047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:35,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:35,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:23:35,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194823851] [2025-03-17 05:23:35,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:35,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:23:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:35,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:23:35,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:23:35,143 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:35,245 INFO L93 Difference]: Finished difference Result 234 states and 306 transitions. [2025-03-17 05:23:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:23:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:35,247 INFO L225 Difference]: With dead ends: 234 [2025-03-17 05:23:35,247 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 05:23:35,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:23:35,247 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 108 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:35,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 960 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 05:23:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2025-03-17 05:23:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 103 states have (on average 1.233009708737864) internal successors, (127), 104 states have internal predecessors, (127), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:23:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2025-03-17 05:23:35,260 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 171 transitions. Word has length 99 [2025-03-17 05:23:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:35,260 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 171 transitions. [2025-03-17 05:23:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2025-03-17 05:23:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:23:35,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:35,261 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:35,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:23:35,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash -438618999, now seen corresponding path program 1 times [2025-03-17 05:23:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:35,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440376152] [2025-03-17 05:23:35,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:35,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:23:35,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:23:35,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:35,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:35,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:23:35,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:23:35,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:23:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:35,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:23:35,409 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:23:35,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:23:35,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:23:35,415 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:35,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:23:35,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:23:35 BoogieIcfgContainer [2025-03-17 05:23:35,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:23:35,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:23:35,490 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:23:35,491 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:23:35,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:29" (3/4) ... [2025-03-17 05:23:35,493 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:23:35,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:23:35,494 INFO L158 Benchmark]: Toolchain (without parser) took 6938.73ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 109.8MB in the beginning and 153.9MB in the end (delta: -44.0MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. [2025-03-17 05:23:35,494 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:35,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.17ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 94.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:23:35,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.68ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 90.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:35,495 INFO L158 Benchmark]: Boogie Preprocessor took 57.73ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:23:35,496 INFO L158 Benchmark]: IcfgBuilder took 579.09ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 54.8MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:23:35,496 INFO L158 Benchmark]: TraceAbstraction took 6014.08ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 54.8MB in the beginning and 154.0MB in the end (delta: -99.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2025-03-17 05:23:35,496 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 369.1MB. Free memory was 154.0MB in the beginning and 153.9MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:35,498 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.55ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.17ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 94.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.68ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 90.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.73ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 579.09ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 54.8MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6014.08ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 54.8MB in the beginning and 154.0MB in the end (delta: -99.2MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 369.1MB. Free memory was 154.0MB in the beginning and 153.9MB in the end (delta: 115.4kB). There was no memory consumed. 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 83, overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryFLOATComparisonOperation at line 38, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET updateVariables() [L92] CALL step() [L37] EXPR unsigned_char_Array_0[0] [L37] unsigned_char_Array_0[1] = (unsigned_char_Array_0[0] + 100) [L38] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L38] EXPR float_Array_0[1] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] float_Array_0[0] = ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))) [L39] EXPR unsigned_char_Array_0[1] [L39] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] signed_long_int_Array_0[0] = (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))) [L44] EXPR float_Array_0[1] [L44] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L44] COND FALSE !(float_Array_0[1] <= float_Array_0[0]) [L49] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L49] COND TRUE unsigned_char_Array_0[1] <= 1000000 [L50] BOOL_unsigned_char_Array_0[1][1] = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((- float_Array_0[0]) > float_Array_0[1]) [L58] EXPR signed_long_int_Array_0[0] [L58] EXPR unsigned_char_Array_0[0] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] [L58] EXPR BOOL_unsigned_char_Array_0[0][1] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] BOOL_unsigned_char_Array_0[0][0] = ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]) [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) [L83] EXPR signed_long_int_Array_0[0] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[0] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L83] EXPR float_Array_0[1] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83-L84] return (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 148 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 520 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 519 mSDsluCounter, 3754 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2627 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1127 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 314 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, InterpolantAutomatonStates: 52, 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, 9 MinimizatonAttempts, 64 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1190 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1176 ConstructedInterpolants, 0 QuantifiedInterpolants, 3134 SizeOfPredicates, 5 NumberOfNonLiveVariables, 751 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 2539/2640 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-03-17 05:23:35,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:23:37,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:23:37,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:23:37,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:23:37,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:23:37,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:23:37,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:23:37,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:23:37,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:23:37,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:23:37,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:23:37,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:23:37,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:23:37,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:23:37,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:23:37,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:23:37,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:23:37,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:37,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:23:37,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:37,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:23:37,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:23:37,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:23:37,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:23:37,558 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2025-03-17 05:23:37,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:23:37,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:23:37,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:23:37,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:23:37,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:23:37,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-03-17 05:23:38,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f54b9b0a/1618e71b88f54875b98ac75cc34b360e/FLAG491f7e88e [2025-03-17 05:23:39,160 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:23:39,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2025-03-17 05:23:39,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f54b9b0a/1618e71b88f54875b98ac75cc34b360e/FLAG491f7e88e [2025-03-17 05:23:39,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f54b9b0a/1618e71b88f54875b98ac75cc34b360e [2025-03-17 05:23:39,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:23:39,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:23:39,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:39,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:23:39,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:23:39,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e228fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39, skipping insertion in model container [2025-03-17 05:23:39,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:23:39,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-03-17 05:23:39,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:39,403 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:23:39,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2025-03-17 05:23:39,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:39,467 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:23:39,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39 WrapperNode [2025-03-17 05:23:39,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:39,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:39,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:23:39,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:23:39,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,521 INFO L138 Inliner]: procedures = 33, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2025-03-17 05:23:39,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:39,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:23:39,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:23:39,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:23:39,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,550 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2025-03-17 05:23:39,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:23:39,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:23:39,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:23:39,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:23:39,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (1/1) ... [2025-03-17 05:23:39,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:39,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:39,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:23:39,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:23:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:23:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:23:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:23:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:23:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:23:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:23:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:23:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:23:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:23:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:23:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:23:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:23:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:23:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:23:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:23:39,742 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:23:39,743 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:23:40,111 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-03-17 05:23:40,171 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-17 05:23:40,171 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:23:40,180 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:23:40,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:23:40,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:40 BoogieIcfgContainer [2025-03-17 05:23:40,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:23:40,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:23:40,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:23:40,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:23:40,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:23:39" (1/3) ... [2025-03-17 05:23:40,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453f4c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:40, skipping insertion in model container [2025-03-17 05:23:40,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:39" (2/3) ... [2025-03-17 05:23:40,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453f4c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:40, skipping insertion in model container [2025-03-17 05:23:40,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:40" (3/3) ... [2025-03-17 05:23:40,189 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2025-03-17 05:23:40,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:23:40,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-42.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:23:40,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:23:40,244 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;@313c3684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:23:40,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:23:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:40,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:40,255 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:40,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1630584443, now seen corresponding path program 1 times [2025-03-17 05:23:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885919375] [2025-03-17 05:23:40,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:40,266 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-03-17 05:23:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:40,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-17 05:23:40,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:40,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:40,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:40,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:40,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:40,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:23:40,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 05:23:40,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:40,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885919375] [2025-03-17 05:23:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885919375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:40,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:40,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:23:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435523655] [2025-03-17 05:23:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:40,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:23:40,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:40,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:23:40,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:40,528 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:40,551 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2025-03-17 05:23:40,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:23:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:23:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:40,557 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:23:40,557 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:23:40,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:40,562 INFO L435 NwaCegarLoop]: 131 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, 131 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-03-17 05:23:40,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:23:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:23:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2025-03-17 05:23:40,587 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2025-03-17 05:23:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:40,587 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2025-03-17 05:23:40,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2025-03-17 05:23:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:40,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:40,590 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:40,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-17 05:23:40,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-17 05:23:40,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:40,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1777071264, now seen corresponding path program 1 times [2025-03-17 05:23:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:40,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453494302] [2025-03-17 05:23:40,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:40,796 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-03-17 05:23:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:40,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-17 05:23:40,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:40,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:40,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:40,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:40,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:23:40,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:41,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 05:23:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:41,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:41,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:41,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453494302] [2025-03-17 05:23:41,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453494302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:41,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:41,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:23:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486784189] [2025-03-17 05:23:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:41,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:23:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:41,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:23:41,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:23:41,059 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:41,088 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2025-03-17 05:23:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:23:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:41,095 INFO L225 Difference]: With dead ends: 181 [2025-03-17 05:23:41,095 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 05:23:41,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:23:41,096 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:41,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 05:23:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 05:23:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2025-03-17 05:23:41,102 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 99 [2025-03-17 05:23:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:41,103 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2025-03-17 05:23:41,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2025-03-17 05:23:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:41,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:41,105 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:41,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:41,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-17 05:23:41,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:41,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1639921828, now seen corresponding path program 1 times [2025-03-17 05:23:41,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:41,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732012469] [2025-03-17 05:23:41,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:41,309 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-03-17 05:23:41,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:41,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-17 05:23:41,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:41,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:41,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:41,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:41,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:41,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:23:41,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:41,530 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 33 treesize of output 28 [2025-03-17 05:23:41,613 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 30 treesize of output 26 [2025-03-17 05:23:41,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-03-17 05:23:41,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:41,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2025-03-17 05:23:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:23:41,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:41,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732012469] [2025-03-17 05:23:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732012469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:41,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:23:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961451378] [2025-03-17 05:23:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:41,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:23:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:41,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:23:41,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:23:41,912 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:42,761 INFO L93 Difference]: Finished difference Result 220 states and 305 transitions. [2025-03-17 05:23:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 05:23:42,762 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:23:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:42,763 INFO L225 Difference]: With dead ends: 220 [2025-03-17 05:23:42,763 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 05:23:42,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:23:42,764 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 296 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:42,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 931 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:23:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 05:23:42,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2025-03-17 05:23:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2025-03-17 05:23:42,777 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 99 [2025-03-17 05:23:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:42,778 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2025-03-17 05:23:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2025-03-17 05:23:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:42,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:42,781 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:42,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:42,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-17 05:23:42,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:42,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 858094109, now seen corresponding path program 1 times [2025-03-17 05:23:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194885115] [2025-03-17 05:23:42,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:42,982 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-03-17 05:23:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:42,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-17 05:23:42,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:43,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:43,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:43,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:43,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:43,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:23:43,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 05:23:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:23:43,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:43,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194885115] [2025-03-17 05:23:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194885115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:43,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:43,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:23:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187914064] [2025-03-17 05:23:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:43,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:23:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:43,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:23:43,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:23:43,166 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:43,184 INFO L93 Difference]: Finished difference Result 187 states and 258 transitions. [2025-03-17 05:23:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:23:43,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:23:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:43,186 INFO L225 Difference]: With dead ends: 187 [2025-03-17 05:23:43,186 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:23:43,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:23:43,190 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:43,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:23:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:23:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2025-03-17 05:23:43,202 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 99 [2025-03-17 05:23:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:43,202 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2025-03-17 05:23:43,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:23:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2025-03-17 05:23:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:43,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:43,205 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:43,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:43,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-17 05:23:43,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:43,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1194438880, now seen corresponding path program 1 times [2025-03-17 05:23:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:43,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28196983] [2025-03-17 05:23:43,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:43,407 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-03-17 05:23:43,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:43,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-17 05:23:43,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:43,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:43,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:43,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:23:43,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:43,582 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 33 treesize of output 28 [2025-03-17 05:23:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:23:43,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:43,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:43,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28196983] [2025-03-17 05:23:43,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28196983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:43,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:23:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183034589] [2025-03-17 05:23:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:43,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:23:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:43,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:23:43,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:23:43,655 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:44,033 INFO L93 Difference]: Finished difference Result 217 states and 296 transitions. [2025-03-17 05:23:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:23:44,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:23:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:44,035 INFO L225 Difference]: With dead ends: 217 [2025-03-17 05:23:44,035 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 05:23:44,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:23:44,038 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 210 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:44,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 514 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 05:23:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2025-03-17 05:23:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2025-03-17 05:23:44,048 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 99 [2025-03-17 05:23:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:44,049 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2025-03-17 05:23:44,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2025-03-17 05:23:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:44,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:44,051 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:44,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2025-03-17 05:23:44,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-17 05:23:44,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -882770463, now seen corresponding path program 1 times [2025-03-17 05:23:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965619854] [2025-03-17 05:23:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:44,253 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-03-17 05:23:44,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:44,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-17 05:23:44,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:44,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:44,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:44,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:44,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:23:44,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:44,440 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 33 treesize of output 28 [2025-03-17 05:23:44,509 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 30 treesize of output 26 [2025-03-17 05:23:44,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-03-17 05:23:44,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 52 [2025-03-17 05:23:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:23:44,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:44,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965619854] [2025-03-17 05:23:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965619854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:44,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:44,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:23:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061124558] [2025-03-17 05:23:44,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:44,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:23:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:44,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:23:44,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:23:44,683 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:45,184 INFO L93 Difference]: Finished difference Result 217 states and 294 transitions. [2025-03-17 05:23:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:23:45,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:23:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:45,186 INFO L225 Difference]: With dead ends: 217 [2025-03-17 05:23:45,186 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 05:23:45,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:23:45,187 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 269 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:45,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 624 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:23:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 05:23:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2025-03-17 05:23:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 78 states have internal predecessors, (102), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2025-03-17 05:23:45,201 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 99 [2025-03-17 05:23:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:45,205 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2025-03-17 05:23:45,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:23:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2025-03-17 05:23:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:45,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:45,206 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:45,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:45,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-17 05:23:45,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1388329088, now seen corresponding path program 1 times [2025-03-17 05:23:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458269178] [2025-03-17 05:23:45,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:45,407 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-03-17 05:23:45,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:45,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-17 05:23:45,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:45,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:45,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:45,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:23:45,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:45,581 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-03-17 05:23:45,617 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 31 treesize of output 15 [2025-03-17 05:23:45,640 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 31 treesize of output 15 [2025-03-17 05:23:45,664 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 26 treesize of output 25 [2025-03-17 05:23:45,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:45,939 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 41 treesize of output 28 [2025-03-17 05:23:45,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:45,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2025-03-17 05:23:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-17 05:23:45,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:23:46,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:46,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458269178] [2025-03-17 05:23:46,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458269178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:23:46,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:46,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-03-17 05:23:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321980920] [2025-03-17 05:23:46,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:46,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:23:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:46,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:23:46,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:46,158 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-17 05:23:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:46,507 INFO L93 Difference]: Finished difference Result 199 states and 261 transitions. [2025-03-17 05:23:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:23:46,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) Word has length 99 [2025-03-17 05:23:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:46,509 INFO L225 Difference]: With dead ends: 199 [2025-03-17 05:23:46,509 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:23:46,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:23:46,510 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 135 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:46,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 386 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:23:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2025-03-17 05:23:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 84 states have internal predecessors, (107), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:23:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2025-03-17 05:23:46,521 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 99 [2025-03-17 05:23:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:46,522 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2025-03-17 05:23:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-17 05:23:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2025-03-17 05:23:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:46,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:46,523 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:46,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2025-03-17 05:23:46,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-03-17 05:23:46,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:46,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1480696043, now seen corresponding path program 1 times [2025-03-17 05:23:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283609166] [2025-03-17 05:23:46,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:46,725 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-03-17 05:23:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:46,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-03-17 05:23:46,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:46,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:46,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:46,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:46,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:46,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:23:46,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:46,964 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-03-17 05:23:47,181 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 121 treesize of output 61 [2025-03-17 05:23:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:23:47,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:48,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283609166] [2025-03-17 05:23:48,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283609166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [540963716] [2025-03-17 05:23:48,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:48,919 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:48,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:48,938 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:23:48,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-17 05:23:49,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:49,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:49,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:49,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:23:49,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:49,708 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 15 treesize of output 1 [2025-03-17 05:23:50,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2025-03-17 05:23:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:23:50,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [540963716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:52,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:52,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-17 05:23:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852391620] [2025-03-17 05:23:52,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:52,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:23:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:52,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:23:52,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:23:52,029 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:23:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:53,282 INFO L93 Difference]: Finished difference Result 377 states and 485 transitions. [2025-03-17 05:23:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:23:53,282 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 99 [2025-03-17 05:23:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:53,284 INFO L225 Difference]: With dead ends: 377 [2025-03-17 05:23:53,284 INFO L226 Difference]: Without dead ends: 278 [2025-03-17 05:23:53,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:23:53,285 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 865 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:53,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 702 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:23:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-17 05:23:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 272. [2025-03-17 05:23:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 230 states have (on average 1.2695652173913043) internal successors, (292), 232 states have internal predecessors, (292), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:23:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 352 transitions. [2025-03-17 05:23:53,318 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 352 transitions. Word has length 99 [2025-03-17 05:23:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:53,319 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 352 transitions. [2025-03-17 05:23:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:23:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 352 transitions. [2025-03-17 05:23:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:23:53,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:53,321 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:53,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:53,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-17 05:23:53,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:53,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1629122421, now seen corresponding path program 1 times [2025-03-17 05:23:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564344764] [2025-03-17 05:23:53,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:53,722 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-03-17 05:23:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:53,724 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-03-17 05:23:53,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:23:53,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:23:53,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:23:53,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:53,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:53,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:23:53,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:54,351 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 121 treesize of output 61 [2025-03-17 05:23:54,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:54,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 58 [2025-03-17 05:23:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:23:54,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:07,134 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:07,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564344764] [2025-03-17 05:24:07,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564344764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:07,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512357713] [2025-03-17 05:24:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:07,134 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:07,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:24:07,136 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:24:07,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-17 05:24:07,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:24:07,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:24:07,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:07,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:07,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:24:07,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:09,186 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 121 treesize of output 61 [2025-03-17 05:24:09,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:09,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 58 [2025-03-17 05:24:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:24:09,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1512357713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:17,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:24:17,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-03-17 05:24:17,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62952366] [2025-03-17 05:24:17,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:24:17,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:24:17,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:17,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:24:17,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:24:17,391 INFO L87 Difference]: Start difference. First operand 272 states and 352 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:22,634 INFO L93 Difference]: Finished difference Result 547 states and 704 transitions. [2025-03-17 05:24:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:24:22,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:24:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:22,637 INFO L225 Difference]: With dead ends: 547 [2025-03-17 05:24:22,637 INFO L226 Difference]: Without dead ends: 276 [2025-03-17 05:24:22,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:24:22,638 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 352 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:22,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1195 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-17 05:24:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-17 05:24:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2025-03-17 05:24:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 228 states have (on average 1.263157894736842) internal successors, (288), 230 states have internal predecessors, (288), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:24:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 348 transitions. [2025-03-17 05:24:22,674 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 348 transitions. Word has length 99 [2025-03-17 05:24:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:22,675 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 348 transitions. [2025-03-17 05:24:22,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 348 transitions. [2025-03-17 05:24:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:24:22,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:22,676 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:22,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:22,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-17 05:24:23,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:23,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1225959498, now seen corresponding path program 1 times [2025-03-17 05:24:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446668919] [2025-03-17 05:24:23,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:23,077 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-03-17 05:24:23,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:23,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-03-17 05:24:23,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 05:24:23,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:24:23,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:24:23,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:23,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:23,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:24:23,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:25,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 34 [2025-03-17 05:24:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:24:25,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:25,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446668919] [2025-03-17 05:24:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446668919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:25,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:25,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:24:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080745633] [2025-03-17 05:24:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:25,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:25,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:25,946 INFO L87 Difference]: Start difference. First operand 270 states and 348 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:28,884 INFO L93 Difference]: Finished difference Result 466 states and 596 transitions. [2025-03-17 05:24:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:28,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:24:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:28,886 INFO L225 Difference]: With dead ends: 466 [2025-03-17 05:24:28,886 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 05:24:28,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:24:28,887 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 183 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:28,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 557 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 05:24:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 05:24:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-03-17 05:24:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 162 states have (on average 1.2469135802469136) internal successors, (202), 163 states have internal predecessors, (202), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:24:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2025-03-17 05:24:28,908 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 99 [2025-03-17 05:24:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:28,909 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2025-03-17 05:24:28,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2025-03-17 05:24:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:24:28,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:28,910 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:28,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2025-03-17 05:24:29,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-03-17 05:24:29,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1472936684, now seen corresponding path program 1 times [2025-03-17 05:24:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767836500] [2025-03-17 05:24:29,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:29,111 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-03-17 05:24:29,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:29,113 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-03-17 05:24:29,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Waiting until timeout for monitored process [2025-03-17 05:24:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:24:29,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:24:29,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:29,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:29,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:24:29,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:24:29,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:29,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767836500] [2025-03-17 05:24:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767836500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:29,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:24:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86362573] [2025-03-17 05:24:29,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:29,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:24:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:29,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:24:29,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:24:29,327 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:29,479 INFO L93 Difference]: Finished difference Result 387 states and 491 transitions. [2025-03-17 05:24:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:24:29,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:24:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:29,482 INFO L225 Difference]: With dead ends: 387 [2025-03-17 05:24:29,482 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 05:24:29,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:24:29,482 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:29,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 05:24:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-17 05:24:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 162 states have (on average 1.2407407407407407) internal successors, (201), 163 states have internal predecessors, (201), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:24:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 245 transitions. [2025-03-17 05:24:29,496 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 245 transitions. Word has length 99 [2025-03-17 05:24:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:29,498 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 245 transitions. [2025-03-17 05:24:29,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2025-03-17 05:24:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:24:29,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:29,499 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:29,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Ended with exit code 0 [2025-03-17 05:24:29,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-03-17 05:24:29,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1287464169, now seen corresponding path program 1 times [2025-03-17 05:24:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763871290] [2025-03-17 05:24:29,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:29,701 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-03-17 05:24:29,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:29,703 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-03-17 05:24:29,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Waiting until timeout for monitored process [2025-03-17 05:24:29,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:24:29,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:24:29,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:29,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:29,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:24:29,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:30,644 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-03-17 05:24:33,137 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 119 treesize of output 59 [2025-03-17 05:24:33,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:33,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 56 [2025-03-17 05:24:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 98 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:24:33,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:24:35,258 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:35,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763871290] [2025-03-17 05:24:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763871290] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2025-03-17 05:24:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665710880] [2025-03-17 05:24:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:35,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:35,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:35,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:24:35,259 INFO L87 Difference]: Start difference. First operand 194 states and 245 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:24:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:36,705 INFO L93 Difference]: Finished difference Result 486 states and 619 transitions. [2025-03-17 05:24:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-17 05:24:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:36,709 INFO L225 Difference]: With dead ends: 486 [2025-03-17 05:24:36,709 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 05:24:36,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:24:36,710 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 101 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:36,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 533 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 05:24:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 05:24:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 205. [2025-03-17 05:24:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.2427745664739884) internal successors, (215), 174 states have internal predecessors, (215), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:24:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2025-03-17 05:24:36,731 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 259 transitions. Word has length 101 [2025-03-17 05:24:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:36,731 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 259 transitions. [2025-03-17 05:24:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:24:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2025-03-17 05:24:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:24:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:36,732 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:36,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Ended with exit code 0 [2025-03-17 05:24:36,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/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-03-17 05:24:36,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:36,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:36,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1822354295, now seen corresponding path program 1 times [2025-03-17 05:24:36,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:36,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040601056] [2025-03-17 05:24:36,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:36,933 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-03-17 05:24:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:36,936 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/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-03-17 05:24:36,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Waiting until timeout for monitored process [2025-03-17 05:24:37,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:24:37,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:24:37,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:37,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:37,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:24:37,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:37,137 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-03-17 05:24:37,467 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 33 treesize of output 28 [2025-03-17 05:24:38,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:38,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 44 [2025-03-17 05:24:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:24:38,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:38,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040601056] [2025-03-17 05:24:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040601056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:38,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:24:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491172848] [2025-03-17 05:24:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:38,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:38,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:38,422 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:42,006 INFO L93 Difference]: Finished difference Result 479 states and 598 transitions. [2025-03-17 05:24:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:24:42,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-03-17 05:24:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:42,008 INFO L225 Difference]: With dead ends: 479 [2025-03-17 05:24:42,009 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 05:24:42,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:24:42,012 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:42,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 648 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 05:24:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 05:24:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 209. [2025-03-17 05:24:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 177 states have (on average 1.2372881355932204) internal successors, (219), 178 states have internal predecessors, (219), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:24:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2025-03-17 05:24:42,031 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 101 [2025-03-17 05:24:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:42,031 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2025-03-17 05:24:42,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:24:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2025-03-17 05:24:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:24:42,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:42,032 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:42,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Ended with exit code 0 [2025-03-17 05:24:42,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/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-03-17 05:24:42,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:42,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash 675661642, now seen corresponding path program 1 times [2025-03-17 05:24:42,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650148910] [2025-03-17 05:24:42,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:42,234 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-03-17 05:24:42,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:42,235 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/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-03-17 05:24:42,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (17)] Waiting until timeout for monitored process [2025-03-17 05:24:42,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:24:42,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:24:42,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:42,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:42,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:24:42,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:42,433 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 30 treesize of output 26 [2025-03-17 05:24:42,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-03-17 05:24:42,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-03-17 05:24:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:24:42,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:42,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650148910] [2025-03-17 05:24:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650148910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:42,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:42,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:24:42,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948454791] [2025-03-17 05:24:42,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:42,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:42,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:42,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:42,999 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:24:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:44,771 INFO L93 Difference]: Finished difference Result 487 states and 605 transitions. [2025-03-17 05:24:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-17 05:24:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:44,773 INFO L225 Difference]: With dead ends: 487 [2025-03-17 05:24:44,773 INFO L226 Difference]: Without dead ends: 279 [2025-03-17 05:24:44,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:24:44,773 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 106 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:44,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 871 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:24:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-17 05:24:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 205. [2025-03-17 05:24:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.2196531791907514) internal successors, (211), 174 states have internal predecessors, (211), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:24:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2025-03-17 05:24:44,790 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 101 [2025-03-17 05:24:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:44,790 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2025-03-17 05:24:44,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:24:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2025-03-17 05:24:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:24:44,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:44,791 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:44,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (17)] Ended with exit code 0 [2025-03-17 05:24:44,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/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-03-17 05:24:44,992 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:44,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -689162073, now seen corresponding path program 1 times [2025-03-17 05:24:44,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744357759] [2025-03-17 05:24:44,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:44,993 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-03-17 05:24:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:44,994 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/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-03-17 05:24:44,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (18)] Waiting until timeout for monitored process [2025-03-17 05:24:45,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:24:45,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:24:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:45,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:24:45,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:45,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:24:48,594 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 119 treesize of output 59 [2025-03-17 05:24:50,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:50,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 56 [2025-03-17 05:24:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 98 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:24:51,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:24:53,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:53,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744357759] [2025-03-17 05:24:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744357759] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:53,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:53,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 21 [2025-03-17 05:24:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471645613] [2025-03-17 05:24:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:53,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:53,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:24:53,435 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:24:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:55,924 INFO L93 Difference]: Finished difference Result 444 states and 549 transitions. [2025-03-17 05:24:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:55,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-17 05:24:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:55,926 INFO L225 Difference]: With dead ends: 444 [2025-03-17 05:24:55,926 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 05:24:55,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:24:55,927 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 104 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:55,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 649 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:24:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 05:24:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 208. [2025-03-17 05:24:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 176 states have (on average 1.2159090909090908) internal successors, (214), 177 states have internal predecessors, (214), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:24:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2025-03-17 05:24:55,952 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 103 [2025-03-17 05:24:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:55,952 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2025-03-17 05:24:55,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:24:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2025-03-17 05:24:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:24:55,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:55,955 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:55,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (18)] Ended with exit code 0 [2025-03-17 05:24:56,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/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-03-17 05:24:56,156 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash -885675578, now seen corresponding path program 1 times [2025-03-17 05:24:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:56,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948784968] [2025-03-17 05:24:56,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:56,157 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-03-17 05:24:56,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:56,159 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/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-03-17 05:24:56,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (19)] Waiting until timeout for monitored process [2025-03-17 05:24:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:24:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:24:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:56,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:24:56,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:58,877 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 119 treesize of output 59 [2025-03-17 05:25:00,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:00,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 47 [2025-03-17 05:25:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:25:01,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:25:03,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948784968] [2025-03-17 05:25:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948784968] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:03,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-03-17 05:25:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69374307] [2025-03-17 05:25:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:03,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:25:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:03,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:25:03,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:25:03,225 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:25:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:05,689 INFO L93 Difference]: Finished difference Result 444 states and 547 transitions. [2025-03-17 05:25:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:25:05,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-17 05:25:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:05,692 INFO L225 Difference]: With dead ends: 444 [2025-03-17 05:25:05,692 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 05:25:05,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:25:05,693 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 269 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:05,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 583 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 05:25:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 05:25:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 205. [2025-03-17 05:25:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.2080924855491328) internal successors, (209), 174 states have internal predecessors, (209), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:25:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 253 transitions. [2025-03-17 05:25:05,711 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 253 transitions. Word has length 103 [2025-03-17 05:25:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:05,711 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 253 transitions. [2025-03-17 05:25:05,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:25:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 253 transitions. [2025-03-17 05:25:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:25:05,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:05,712 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:05,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (19)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:05,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/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-03-17 05:25:05,912 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1439540058, now seen corresponding path program 1 times [2025-03-17 05:25:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707815946] [2025-03-17 05:25:05,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:05,913 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-03-17 05:25:05,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:05,915 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/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-03-17 05:25:05,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (20)] Waiting until timeout for monitored process [2025-03-17 05:25:05,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:25:06,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:25:06,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:06,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:06,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:25:06,064 INFO L279 TraceCheckSpWp]: Computing forward predicates...