./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:44:11,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:44:11,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:44:11,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:44:11,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:44:11,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:44:11,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:44:11,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:44:11,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:44:11,598 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:44:11,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:44:11,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:44:11,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:44:11,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:44:11,598 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:44:11,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:44:11,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:44:11,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:44:11,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:44:11,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:44:11,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:44:11,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:44:11,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:44:11,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:44:11,602 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a [2025-02-06 03:44:11,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:44:11,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:44:11,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:44:11,804 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:44:11,804 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:44:11,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2025-02-06 03:44:12,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb48258bb/2ee45a2aa9eb44b880a76556504f474a/FLAG87911b6e9 [2025-02-06 03:44:13,159 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:44:13,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2025-02-06 03:44:13,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb48258bb/2ee45a2aa9eb44b880a76556504f474a/FLAG87911b6e9 [2025-02-06 03:44:13,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb48258bb/2ee45a2aa9eb44b880a76556504f474a [2025-02-06 03:44:13,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:44:13,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:44:13,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:44:13,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:44:13,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:44:13,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408941e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13, skipping insertion in model container [2025-02-06 03:44:13,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:44:13,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2025-02-06 03:44:13,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:44:13,672 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:44:13,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2025-02-06 03:44:13,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:44:13,722 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:44:13,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13 WrapperNode [2025-02-06 03:44:13,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:44:13,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:44:13,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:44:13,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:44:13,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,758 INFO L138 Inliner]: procedures = 29, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2025-02-06 03:44:13,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:44:13,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:44:13,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:44:13,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:44:13,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,788 INFO L175 MemorySlicer]: Split 134 memory accesses to 15 slices as follows [2, 5, 10, 12, 17, 14, 12, 10, 12, 6, 6, 10, 3, 6, 9]. 13 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:44:13,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:44:13,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:44:13,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:44:13,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:44:13,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (1/1) ... [2025-02-06 03:44:13,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:44:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:13,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:44:13,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:44:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:44:13,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:44:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:44:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:44:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:44:13,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:44:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:44:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:44:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:44:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:44:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:44:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:44:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:44:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:44:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 03:44:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:44:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:44:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:44:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:44:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:44:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:44:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:44:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:44:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 03:44:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:44:13,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:44:14,027 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:44:14,029 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:44:14,434 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-02-06 03:44:14,479 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-02-06 03:44:14,479 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:44:14,486 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:44:14,487 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:44:14,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:14 BoogieIcfgContainer [2025-02-06 03:44:14,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:44:14,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:44:14,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:44:14,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:44:14,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:44:13" (1/3) ... [2025-02-06 03:44:14,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f78b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:14, skipping insertion in model container [2025-02-06 03:44:14,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:13" (2/3) ... [2025-02-06 03:44:14,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f78b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:14, skipping insertion in model container [2025-02-06 03:44:14,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:14" (3/3) ... [2025-02-06 03:44:14,493 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-73.i [2025-02-06 03:44:14,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:44:14,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-73.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:44:14,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:44:14,557 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;@4f665159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:44:14,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:44:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:44:14,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:14,570 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:14,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1472770664, now seen corresponding path program 1 times [2025-02-06 03:44:14,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:14,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166245000] [2025-02-06 03:44:14,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:14,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:14,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:14,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:14,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:44:14,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166245000] [2025-02-06 03:44:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166245000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504535644] [2025-02-06 03:44:14,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:14,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:14,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:44:15,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:15,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:15,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:15,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:15,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:44:15,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:44:15,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504535644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:15,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:15,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:44:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245459440] [2025-02-06 03:44:15,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:44:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:15,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:44:15,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:44:15,179 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:15,198 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2025-02-06 03:44:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:44:15,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-02-06 03:44:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:15,205 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:44:15,206 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:44:15,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:44:15,211 INFO L435 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:15,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:44:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 03:44:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-02-06 03:44:15,243 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2025-02-06 03:44:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:15,243 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-02-06 03:44:15,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-02-06 03:44:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:44:15,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:15,247 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:15,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:44:15,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:44:15,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:15,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash 234376633, now seen corresponding path program 1 times [2025-02-06 03:44:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94527915] [2025-02-06 03:44:15,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:15,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:15,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:15,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:15,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:44:15,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:15,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94527915] [2025-02-06 03:44:15,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94527915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:15,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755825752] [2025-02-06 03:44:15,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:15,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:15,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:15,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:15,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:44:15,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:16,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:16,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:16,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:16,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:44:16,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:16,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:16,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755825752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:16,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:16,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:44:16,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8743305] [2025-02-06 03:44:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:16,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:16,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:16,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:16,065 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:16,108 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2025-02-06 03:44:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:16,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:44:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:16,109 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:44:16,109 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:44:16,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:16,110 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:16,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:44:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-02-06 03:44:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-02-06 03:44:16,118 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2025-02-06 03:44:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:16,119 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-02-06 03:44:16,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-02-06 03:44:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:44:16,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:16,123 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:16,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:44:16,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:16,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:16,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1121880314, now seen corresponding path program 1 times [2025-02-06 03:44:16,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:16,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991983902] [2025-02-06 03:44:16,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:16,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:16,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:16,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:16,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:44:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991983902] [2025-02-06 03:44:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991983902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973729028] [2025-02-06 03:44:16,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:16,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:16,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:44:16,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:16,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:16,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:16,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:16,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:44:16,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:16,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:16,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973729028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:16,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:16,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:44:16,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120649750] [2025-02-06 03:44:16,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:16,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:16,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:16,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:16,726 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:16,759 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-02-06 03:44:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:44:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:16,761 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:44:16,761 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 03:44:16,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:16,764 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:16,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 03:44:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-02-06 03:44:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-02-06 03:44:16,776 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2025-02-06 03:44:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:16,777 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-02-06 03:44:16,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-02-06 03:44:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:44:16,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:16,781 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:16,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:44:16,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:16,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:16,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1122803835, now seen corresponding path program 1 times [2025-02-06 03:44:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26692709] [2025-02-06 03:44:16,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:17,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:17,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:17,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:17,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:44:17,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26692709] [2025-02-06 03:44:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26692709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894570568] [2025-02-06 03:44:17,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:17,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:44:17,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:44:17,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:17,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:17,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:17,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:17,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:44:17,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:17,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894570568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:17,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:17,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:44:17,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109455389] [2025-02-06 03:44:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:17,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:17,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:17,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:44:17,393 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:17,423 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2025-02-06 03:44:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:17,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:44:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:17,425 INFO L225 Difference]: With dead ends: 219 [2025-02-06 03:44:17,425 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 03:44:17,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:44:17,426 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:17,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 03:44:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 03:44:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-02-06 03:44:17,438 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 129 [2025-02-06 03:44:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:17,439 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-02-06 03:44:17,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-02-06 03:44:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:44:17,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:17,440 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:17,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:44:17,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:44:17,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:17,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash 24877465, now seen corresponding path program 1 times [2025-02-06 03:44:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815390091] [2025-02-06 03:44:17,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:17,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:44:17,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:44:17,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:17,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:18,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:18,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815390091] [2025-02-06 03:44:18,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815390091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:18,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:18,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:44:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418110877] [2025-02-06 03:44:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:18,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:44:18,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:18,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:44:18,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:18,028 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:18,181 INFO L93 Difference]: Finished difference Result 332 states and 480 transitions. [2025-02-06 03:44:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:44:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-02-06 03:44:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:18,183 INFO L225 Difference]: With dead ends: 332 [2025-02-06 03:44:18,183 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 03:44:18,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02-06 03:44:18,184 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 105 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:18,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 637 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 03:44:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2025-02-06 03:44:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 314 transitions. [2025-02-06 03:44:18,200 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 314 transitions. Word has length 131 [2025-02-06 03:44:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:18,201 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 314 transitions. [2025-02-06 03:44:18,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 314 transitions. [2025-02-06 03:44:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:44:18,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:18,203 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:18,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:44:18,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:18,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash 236228378, now seen corresponding path program 1 times [2025-02-06 03:44:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340029380] [2025-02-06 03:44:18,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:18,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:18,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:44:18,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:44:18,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:18,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:18,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:18,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340029380] [2025-02-06 03:44:18,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340029380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:18,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:18,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:44:18,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118256755] [2025-02-06 03:44:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:18,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:44:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:18,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:44:18,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:18,665 INFO L87 Difference]: Start difference. First operand 217 states and 314 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:18,969 INFO L93 Difference]: Finished difference Result 496 states and 718 transitions. [2025-02-06 03:44:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:44:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-02-06 03:44:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:18,971 INFO L225 Difference]: With dead ends: 496 [2025-02-06 03:44:18,971 INFO L226 Difference]: Without dead ends: 282 [2025-02-06 03:44:18,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:44:18,972 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 248 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:18,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1248 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:44:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-06 03:44:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 215. [2025-02-06 03:44:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2025-02-06 03:44:18,987 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 131 [2025-02-06 03:44:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2025-02-06 03:44:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2025-02-06 03:44:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:18,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:18,989 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:18,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:44:18,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:18,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash -46186827, now seen corresponding path program 1 times [2025-02-06 03:44:18,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:18,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818876774] [2025-02-06 03:44:18,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:19,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:19,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:19,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:19,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:19,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:19,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818876774] [2025-02-06 03:44:19,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818876774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:19,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:19,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672679704] [2025-02-06 03:44:19,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:19,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:19,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:19,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:19,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:19,193 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:19,241 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2025-02-06 03:44:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:19,243 INFO L225 Difference]: With dead ends: 379 [2025-02-06 03:44:19,243 INFO L226 Difference]: Without dead ends: 270 [2025-02-06 03:44:19,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:19,244 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:19,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 615 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-06 03:44:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 230. [2025-02-06 03:44:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 197 states have (on average 1.3959390862944163) internal successors, (275), 197 states have internal predecessors, (275), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2025-02-06 03:44:19,271 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 132 [2025-02-06 03:44:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:19,271 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2025-02-06 03:44:19,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2025-02-06 03:44:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:19,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:19,272 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:19,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:44:19,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:19,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -551745452, now seen corresponding path program 1 times [2025-02-06 03:44:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138426467] [2025-02-06 03:44:19,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:19,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:19,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:19,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:19,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:19,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:19,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138426467] [2025-02-06 03:44:19,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138426467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:19,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279157454] [2025-02-06 03:44:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:19,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:19,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:19,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:19,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:19,572 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:19,678 INFO L93 Difference]: Finished difference Result 518 states and 755 transitions. [2025-02-06 03:44:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:19,680 INFO L225 Difference]: With dead ends: 518 [2025-02-06 03:44:19,680 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 03:44:19,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:19,681 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 149 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:19,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 651 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 03:44:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 230. [2025-02-06 03:44:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 197 states have (on average 1.380710659898477) internal successors, (272), 197 states have internal predecessors, (272), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-02-06 03:44:19,699 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 132 [2025-02-06 03:44:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:19,699 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-02-06 03:44:19,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-02-06 03:44:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:19,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:19,701 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:19,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:44:19,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -340394539, now seen corresponding path program 1 times [2025-02-06 03:44:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570832515] [2025-02-06 03:44:19,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:19,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:19,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:19,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:19,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:19,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:20,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570832515] [2025-02-06 03:44:20,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570832515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:20,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:20,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:44:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263714451] [2025-02-06 03:44:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:20,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:44:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:20,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:44:20,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:44:20,275 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:20,671 INFO L93 Difference]: Finished difference Result 522 states and 755 transitions. [2025-02-06 03:44:20,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:44:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:20,675 INFO L225 Difference]: With dead ends: 522 [2025-02-06 03:44:20,675 INFO L226 Difference]: Without dead ends: 398 [2025-02-06 03:44:20,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:44:20,677 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 291 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:20,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1151 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:44:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-06 03:44:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 230. [2025-02-06 03:44:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 197 states have (on average 1.3756345177664975) internal successors, (271), 197 states have internal predecessors, (271), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 331 transitions. [2025-02-06 03:44:20,705 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 331 transitions. Word has length 132 [2025-02-06 03:44:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:20,706 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 331 transitions. [2025-02-06 03:44:20,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 331 transitions. [2025-02-06 03:44:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:20,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:20,708 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:20,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:44:20,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:20,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:20,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1021481492, now seen corresponding path program 1 times [2025-02-06 03:44:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138744987] [2025-02-06 03:44:20,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:20,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:20,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:20,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:20,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:44:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138744987] [2025-02-06 03:44:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138744987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:21,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:21,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:44:21,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224447792] [2025-02-06 03:44:21,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:21,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:44:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:44:21,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:44:21,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:21,122 INFO L87 Difference]: Start difference. First operand 230 states and 331 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:21,447 INFO L93 Difference]: Finished difference Result 625 states and 901 transitions. [2025-02-06 03:44:21,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:44:21,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:21,450 INFO L225 Difference]: With dead ends: 625 [2025-02-06 03:44:21,450 INFO L226 Difference]: Without dead ends: 398 [2025-02-06 03:44:21,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:44:21,451 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 183 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:21,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1059 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:44:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-06 03:44:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 333. [2025-02-06 03:44:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 284 states have (on average 1.369718309859155) internal successors, (389), 284 states have internal predecessors, (389), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 03:44:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 479 transitions. [2025-02-06 03:44:21,468 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 479 transitions. Word has length 132 [2025-02-06 03:44:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:21,468 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 479 transitions. [2025-02-06 03:44:21,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 479 transitions. [2025-02-06 03:44:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:21,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:21,469 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:44:21,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1532015669, now seen corresponding path program 1 times [2025-02-06 03:44:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:44:21,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011899507] [2025-02-06 03:44:21,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:44:21,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:21,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:21,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:21,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:44:21,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:44:21,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:21,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:21,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:21,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:44:21,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:44:21,619 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:44:21,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:44:21,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:44:21,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:21,751 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:44:21,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:44:21 BoogieIcfgContainer [2025-02-06 03:44:21,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:44:21,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:44:21,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:44:21,755 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:44:21,755 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:14" (3/4) ... [2025-02-06 03:44:21,756 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:44:21,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:44:21,758 INFO L158 Benchmark]: Toolchain (without parser) took 8254.15ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 153.6MB in the beginning and 250.6MB in the end (delta: -97.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2025-02-06 03:44:21,758 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:44:21,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.47ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 139.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:44:21,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.04ms. Allocated memory is still 201.3MB. Free memory was 139.1MB in the beginning and 135.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:44:21,758 INFO L158 Benchmark]: Boogie Preprocessor took 59.79ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 131.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:44:21,758 INFO L158 Benchmark]: IcfgBuilder took 667.85ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 90.5MB in the end (delta: 40.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:44:21,759 INFO L158 Benchmark]: TraceAbstraction took 7265.57ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 90.1MB in the beginning and 250.7MB in the end (delta: -160.6MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. [2025-02-06 03:44:21,759 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 318.8MB. Free memory was 250.7MB in the beginning and 250.6MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:44:21,760 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.23ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.47ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 139.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.04ms. Allocated memory is still 201.3MB. Free memory was 139.1MB in the beginning and 135.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.79ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 131.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 667.85ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 90.5MB in the end (delta: 40.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7265.57ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 90.1MB in the beginning and 250.7MB in the end (delta: -160.6MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 318.8MB. Free memory was 250.7MB in the beginning and 250.6MB in the end (delta: 92.3kB). 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 98, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L22] double var_1_1 = 5.5; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_6 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char* var_1_6_Pointer = &(var_1_6); [L26] double var_1_7 = -0.41; [L26] double var_1_7 = -0.41; [L27] double* var_1_7_Pointer = &(var_1_7); [L28] unsigned char var_1_8 = 25; [L28] unsigned char var_1_8 = 25; [L29] unsigned char* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_9 = 100; [L30] unsigned char var_1_9 = 100; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] unsigned char var_1_10 = 1; [L32] unsigned char var_1_10 = 1; [L33] unsigned char* var_1_10_Pointer = &(var_1_10); [L34] float var_1_12 = 15.75; [L34] float var_1_12 = 15.75; [L35] float* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 1.6; [L36] float var_1_13 = 1.6; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] unsigned char var_1_14 = 0; [L38] unsigned char var_1_14 = 0; [L39] unsigned char* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 0; [L40] unsigned char var_1_15 = 0; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 16.5; [L42] float var_1_16 = 16.5; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] signed char var_1_17 = 10; [L44] signed char var_1_17 = 10; [L45] signed char* var_1_17_Pointer = &(var_1_17); [L46] signed char var_1_18 = -10; [L46] signed char var_1_18 = -10; [L47] signed char* var_1_18_Pointer = &(var_1_18); [L48] signed long int var_1_19 = -16; [L48] signed long int var_1_19 = -16; [L49] signed long int* var_1_19_Pointer = &(var_1_19); [L50] float last_1_var_1_12 = 15.75; VAL [isInitial=0, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] EXPR \read(var_1_12) [L112] last_1_var_1_12 = var_1_12 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L86] var_1_6 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_7) [L90] EXPR var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F [L90] EXPR \read(var_1_7) [L90] EXPR var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] var_1_10 = __VERIFIER_nondet_uchar() [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] var_1_14 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L100] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L100] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] var_1_15 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L103] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L103] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L105] var_1_16 = __VERIFIER_nondet_float() [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L107] var_1_18 = __VERIFIER_nondet_char() [L108] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L108] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L108] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L109] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L109] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L109] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L123] RET updateVariables() [L124] CALL step() [L54] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] COND FALSE !((*(var_1_6_Pointer))) [L57] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L57] COND FALSE !(last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) [L61] EXPR \read(*var_1_8_Pointer) [L61] (*(var_1_19_Pointer)) = (*(var_1_8_Pointer)) [L62] EXPR \read(*var_1_19_Pointer) [L62] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L62] COND FALSE !((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) [L73] EXPR \read(*var_1_13_Pointer) [L73] (*(var_1_12_Pointer)) = (*(var_1_13_Pointer)) [L75] EXPR \read(*var_1_8_Pointer) [L75] EXPR \read(*var_1_8_Pointer) [L75] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) [L75] EXPR \read(*var_1_8_Pointer) [L75] EXPR \read(*var_1_19_Pointer) [L75] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] signed long int stepLocal_0 = ((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))); [L76] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] COND TRUE (*(var_1_8_Pointer)) <= stepLocal_0 [L77] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] COND TRUE ! (*(var_1_6_Pointer)) [L78] EXPR \read(*var_1_7_Pointer) [L78] (*(var_1_1_Pointer)) = (*(var_1_7_Pointer)) [L83] EXPR \read(*var_1_18_Pointer) [L83] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_19_Pointer) [L115] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1 [L115] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_7_Pointer) [L115] EXPR (! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115-L116] return ((((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1039 mSDsluCounter, 6857 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4996 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1333 IncrementalHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1861 mSDtfsCounter, 1333 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 409 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1954 NumberOfCodeBlocks, 1954 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1808 ConstructedInterpolants, 0 QuantifiedInterpolants, 3379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2297 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 5726/5880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:44:21,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:44:23,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:44:23,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:44:23,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:44:23,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:44:23,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:44:23,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:44:23,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:44:23,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:44:23,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:44:23,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:44:23,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:44:23,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:44:23,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:44:23,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:44:23,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:44:23,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:44:23,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a [2025-02-06 03:44:24,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:44:24,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:44:24,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:44:24,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:44:24,039 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:44:24,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2025-02-06 03:44:25,204 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb962b2ab/439de2c91b0748729d2a5148bfeb0294/FLAGa697df2bd [2025-02-06 03:44:25,380 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:44:25,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2025-02-06 03:44:25,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb962b2ab/439de2c91b0748729d2a5148bfeb0294/FLAGa697df2bd [2025-02-06 03:44:25,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb962b2ab/439de2c91b0748729d2a5148bfeb0294 [2025-02-06 03:44:25,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:44:25,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:44:25,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:44:25,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:44:25,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:44:25,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:25,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532cb4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25, skipping insertion in model container [2025-02-06 03:44:25,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:25,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:44:25,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2025-02-06 03:44:25,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:44:25,956 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:44:25,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2025-02-06 03:44:25,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:44:25,998 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:44:25,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25 WrapperNode [2025-02-06 03:44:25,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:44:26,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:44:26,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:44:26,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:44:26,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,047 INFO L138 Inliner]: procedures = 36, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 526 [2025-02-06 03:44:26,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:44:26,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:44:26,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:44:26,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:44:26,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,106 INFO L175 MemorySlicer]: Split 134 memory accesses to 15 slices as follows [2, 5, 10, 12, 17, 14, 12, 10, 12, 6, 6, 10, 3, 6, 9]. 13 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:44:26,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:44:26,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:44:26,167 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:44:26,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:44:26,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (1/1) ... [2025-02-06 03:44:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:44:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:44:26,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:44:26,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:44:26,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:44:26,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2025-02-06 03:44:26,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-02-06 03:44:26,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:44:26,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-02-06 03:44:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-02-06 03:44:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:44:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:44:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-02-06 03:44:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:44:26,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:44:26,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:44:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-02-06 03:44:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-02-06 03:44:26,410 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:44:26,412 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:44:28,680 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-02-06 03:44:28,723 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-02-06 03:44:28,723 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:44:28,731 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:44:28,731 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:44:28,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:28 BoogieIcfgContainer [2025-02-06 03:44:28,731 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:44:28,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:44:28,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:44:28,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:44:28,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:44:25" (1/3) ... [2025-02-06 03:44:28,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab8e5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:28, skipping insertion in model container [2025-02-06 03:44:28,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:25" (2/3) ... [2025-02-06 03:44:28,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab8e5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:28, skipping insertion in model container [2025-02-06 03:44:28,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:28" (3/3) ... [2025-02-06 03:44:28,750 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-73.i [2025-02-06 03:44:28,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:44:28,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-73.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:44:28,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:44:28,806 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;@524c173d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:44:28,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:44:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:44:28,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:28,817 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:28,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1472770664, now seen corresponding path program 1 times [2025-02-06 03:44:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216260018] [2025-02-06 03:44:28,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:28,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:28,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:28,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:28,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:44:29,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:29,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:29,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:29,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:29,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:44:29,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-02-06 03:44:29,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:29,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216260018] [2025-02-06 03:44:29,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216260018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:29,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:29,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:44:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991225094] [2025-02-06 03:44:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:29,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:44:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:29,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:44:29,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:44:29,300 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:29,317 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2025-02-06 03:44:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:44:29,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-02-06 03:44:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:29,322 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:44:29,322 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:44:29,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:44:29,326 INFO L435 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:29,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:44:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 03:44:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-02-06 03:44:29,356 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2025-02-06 03:44:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:29,356 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-02-06 03:44:29,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-02-06 03:44:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:44:29,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:29,358 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:29,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:44:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:29,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 234376633, now seen corresponding path program 1 times [2025-02-06 03:44:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202936898] [2025-02-06 03:44:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:29,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:29,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:29,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:44:29,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:29,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:29,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:29,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:29,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:44:29,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:30,289 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 17 treesize of output 13 [2025-02-06 03:44:30,331 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 13 [2025-02-06 03:44:30,335 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 18 [2025-02-06 03:44:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:30,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:30,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202936898] [2025-02-06 03:44:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202936898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:30,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:30,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:44:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181317947] [2025-02-06 03:44:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:30,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:30,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:30,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:30,371 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:31,422 INFO L93 Difference]: Finished difference Result 371 states and 545 transitions. [2025-02-06 03:44:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:31,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:44:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:31,425 INFO L225 Difference]: With dead ends: 371 [2025-02-06 03:44:31,425 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 03:44:31,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:31,426 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 168 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:31,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 696 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:44:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 03:44:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 203. [2025-02-06 03:44:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 170 states have (on average 1.4058823529411764) internal successors, (239), 170 states have internal predecessors, (239), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2025-02-06 03:44:31,455 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 129 [2025-02-06 03:44:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:31,456 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2025-02-06 03:44:31,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2025-02-06 03:44:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:44:31,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:31,458 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:31,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:44:31,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:31,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -610095238, now seen corresponding path program 1 times [2025-02-06 03:44:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175389185] [2025-02-06 03:44:31,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:31,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:31,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:44:31,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:44:31,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:44:31,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:31,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:31,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:44:31,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:32,223 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 17 treesize of output 13 [2025-02-06 03:44:32,260 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 29 treesize of output 21 [2025-02-06 03:44:32,284 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 28 treesize of output 16 [2025-02-06 03:44:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:32,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:32,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175389185] [2025-02-06 03:44:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175389185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768077107] [2025-02-06 03:44:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:32,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:44:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:32,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:44:32,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:32,300 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:33,160 INFO L93 Difference]: Finished difference Result 468 states and 688 transitions. [2025-02-06 03:44:33,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:44:33,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:44:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:33,162 INFO L225 Difference]: With dead ends: 468 [2025-02-06 03:44:33,162 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 03:44:33,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:44:33,163 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 227 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:33,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 897 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:44:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 03:44:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 203. [2025-02-06 03:44:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 298 transitions. [2025-02-06 03:44:33,177 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 298 transitions. Word has length 129 [2025-02-06 03:44:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:33,177 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 298 transitions. [2025-02-06 03:44:33,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 298 transitions. [2025-02-06 03:44:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:44:33,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:33,179 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:33,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:44:33,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:33,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:33,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1499105749, now seen corresponding path program 1 times [2025-02-06 03:44:33,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:33,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188651201] [2025-02-06 03:44:33,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:33,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:33,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:33,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:33,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:44:33,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:44:33,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:44:33,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:33,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:33,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:44:33,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:33,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:33,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188651201] [2025-02-06 03:44:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188651201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:33,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:44:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148915712] [2025-02-06 03:44:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:33,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:33,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:33,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:44:33,709 INFO L87 Difference]: Start difference. First operand 203 states and 298 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:33,735 INFO L93 Difference]: Finished difference Result 407 states and 599 transitions. [2025-02-06 03:44:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-02-06 03:44:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:33,740 INFO L225 Difference]: With dead ends: 407 [2025-02-06 03:44:33,740 INFO L226 Difference]: Without dead ends: 207 [2025-02-06 03:44:33,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:44:33,741 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:33,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-06 03:44:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-02-06 03:44:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3908045977011494) internal successors, (242), 174 states have internal predecessors, (242), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 302 transitions. [2025-02-06 03:44:33,762 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 302 transitions. Word has length 130 [2025-02-06 03:44:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:33,762 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 302 transitions. [2025-02-06 03:44:33,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 302 transitions. [2025-02-06 03:44:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:33,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:33,763 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:33,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:44:33,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:33,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:33,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash -934614029, now seen corresponding path program 1 times [2025-02-06 03:44:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:33,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699852453] [2025-02-06 03:44:33,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:33,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:33,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:33,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:33,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:44:34,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:34,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:34,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:34,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:34,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:44:34,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:34,618 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 27 treesize of output 15 [2025-02-06 03:44:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:44:34,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:44:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:34,827 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:34,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699852453] [2025-02-06 03:44:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699852453] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:34,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:44:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-02-06 03:44:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624387574] [2025-02-06 03:44:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:34,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:34,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:34,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:34,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:44:34,828 INFO L87 Difference]: Start difference. First operand 207 states and 302 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:34,918 INFO L93 Difference]: Finished difference Result 363 states and 529 transitions. [2025-02-06 03:44:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:34,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:34,921 INFO L225 Difference]: With dead ends: 363 [2025-02-06 03:44:34,921 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 03:44:34,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:44:34,923 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 61 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:34,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 595 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:44:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 03:44:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2025-02-06 03:44:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.4074074074074074) internal successors, (266), 189 states have internal predecessors, (266), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2025-02-06 03:44:34,933 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 132 [2025-02-06 03:44:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:34,933 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2025-02-06 03:44:34,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2025-02-06 03:44:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:34,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:34,934 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:34,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:44:35,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:35,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1440172654, now seen corresponding path program 1 times [2025-02-06 03:44:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:35,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442505799] [2025-02-06 03:44:35,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:35,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:35,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:35,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:35,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:44:35,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:35,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:35,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:35,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:35,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:44:35,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:35,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:35,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:35,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442505799] [2025-02-06 03:44:35,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442505799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:35,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:35,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:35,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119534281] [2025-02-06 03:44:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:35,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:35,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:35,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:35,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:35,444 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:35,486 INFO L93 Difference]: Finished difference Result 451 states and 663 transitions. [2025-02-06 03:44:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:35,490 INFO L225 Difference]: With dead ends: 451 [2025-02-06 03:44:35,490 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 03:44:35,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:35,491 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:35,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 03:44:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-02-06 03:44:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 197 states have (on average 1.3908629441624365) internal successors, (274), 197 states have internal predecessors, (274), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 334 transitions. [2025-02-06 03:44:35,504 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 334 transitions. Word has length 132 [2025-02-06 03:44:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:35,505 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 334 transitions. [2025-02-06 03:44:35,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 334 transitions. [2025-02-06 03:44:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:35,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:35,508 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:35,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:44:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:35,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash -552668973, now seen corresponding path program 1 times [2025-02-06 03:44:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283443488] [2025-02-06 03:44:35,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:35,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:35,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:35,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:35,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:44:35,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:35,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:35,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:35,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:35,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:44:36,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:36,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:36,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283443488] [2025-02-06 03:44:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283443488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:44:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682578063] [2025-02-06 03:44:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:44:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:36,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:44:36,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:36,030 INFO L87 Difference]: Start difference. First operand 230 states and 334 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:36,085 INFO L93 Difference]: Finished difference Result 463 states and 673 transitions. [2025-02-06 03:44:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:44:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:36,088 INFO L225 Difference]: With dead ends: 463 [2025-02-06 03:44:36,088 INFO L226 Difference]: Without dead ends: 236 [2025-02-06 03:44:36,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:36,089 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:36,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:44:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-06 03:44:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-02-06 03:44:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 201 states have internal predecessors, (278), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 338 transitions. [2025-02-06 03:44:36,097 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 338 transitions. Word has length 132 [2025-02-06 03:44:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:36,097 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 338 transitions. [2025-02-06 03:44:36,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 338 transitions. [2025-02-06 03:44:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:36,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:36,098 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:36,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:44:36,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:36,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:36,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:36,299 INFO L85 PathProgramCache]: Analyzing trace with hash -551745452, now seen corresponding path program 1 times [2025-02-06 03:44:36,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:36,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627954261] [2025-02-06 03:44:36,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:36,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:36,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:36,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:36,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:44:36,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:36,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:36,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:36,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:44:36,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:36,607 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 17 treesize of output 13 [2025-02-06 03:44:36,626 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 13 [2025-02-06 03:44:36,629 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 26 treesize of output 14 [2025-02-06 03:44:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:36,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:36,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:36,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627954261] [2025-02-06 03:44:36,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627954261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:36,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:36,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:44:36,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447767185] [2025-02-06 03:44:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:36,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:44:36,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:36,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:44:36,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:44:36,650 INFO L87 Difference]: Start difference. First operand 234 states and 338 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:37,432 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2025-02-06 03:44:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:44:37,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:37,435 INFO L225 Difference]: With dead ends: 420 [2025-02-06 03:44:37,435 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 03:44:37,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:37,435 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 147 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:37,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 537 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:44:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 03:44:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2025-02-06 03:44:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 201 states have (on average 1.373134328358209) internal successors, (276), 201 states have internal predecessors, (276), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 336 transitions. [2025-02-06 03:44:37,449 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 336 transitions. Word has length 132 [2025-02-06 03:44:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:37,449 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 336 transitions. [2025-02-06 03:44:37,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 336 transitions. [2025-02-06 03:44:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:37,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:37,450 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:37,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:44:37,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:37,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:37,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash -340394539, now seen corresponding path program 1 times [2025-02-06 03:44:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102260071] [2025-02-06 03:44:37,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:37,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:37,654 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:37,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:44:37,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:37,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:37,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:37,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:37,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:44:37,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:37,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 17 treesize of output 13 [2025-02-06 03:44:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:38,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:38,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102260071] [2025-02-06 03:44:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102260071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:38,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:38,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:38,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117605994] [2025-02-06 03:44:38,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:38,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:38,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:38,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:38,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:38,029 INFO L87 Difference]: Start difference. First operand 234 states and 336 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:38,898 INFO L93 Difference]: Finished difference Result 420 states and 605 transitions. [2025-02-06 03:44:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:38,900 INFO L225 Difference]: With dead ends: 420 [2025-02-06 03:44:38,900 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 03:44:38,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:38,900 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 143 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:38,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 688 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:44:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 03:44:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 129. [2025-02-06 03:44:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 112 states have internal predecessors, (153), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:44:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2025-02-06 03:44:38,920 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 132 [2025-02-06 03:44:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:38,921 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2025-02-06 03:44:38,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2025-02-06 03:44:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:38,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:38,922 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:38,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:44:39,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:39,122 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:39,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1021481492, now seen corresponding path program 1 times [2025-02-06 03:44:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178995260] [2025-02-06 03:44:39,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:39,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:39,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:39,125 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:39,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:44:39,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:39,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:39,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:39,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:39,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:44:39,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:39,757 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 17 treesize of output 13 [2025-02-06 03:44:39,814 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 13 [2025-02-06 03:44:39,820 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 18 [2025-02-06 03:44:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:44:39,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:39,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178995260] [2025-02-06 03:44:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178995260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:39,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:39,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:44:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548747442] [2025-02-06 03:44:39,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:39,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:44:39,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:39,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:44:39,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:44:39,842 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:40,464 INFO L93 Difference]: Finished difference Result 425 states and 607 transitions. [2025-02-06 03:44:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:44:40,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:44:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:40,467 INFO L225 Difference]: With dead ends: 425 [2025-02-06 03:44:40,467 INFO L226 Difference]: Without dead ends: 299 [2025-02-06 03:44:40,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:40,468 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 216 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:40,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 638 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:44:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-06 03:44:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 234. [2025-02-06 03:44:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 201 states have (on average 1.3582089552238805) internal successors, (273), 201 states have internal predecessors, (273), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 333 transitions. [2025-02-06 03:44:40,490 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 333 transitions. Word has length 132 [2025-02-06 03:44:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:40,491 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 333 transitions. [2025-02-06 03:44:40,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:44:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 333 transitions. [2025-02-06 03:44:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:44:40,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:40,492 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:40,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:44:40,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:40,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:40,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1532015669, now seen corresponding path program 1 times [2025-02-06 03:44:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:40,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462031260] [2025-02-06 03:44:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:40,695 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:40,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:44:40,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:44:41,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:44:41,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:41,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:41,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:44:41,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:41,186 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 77 treesize of output 41 [2025-02-06 03:44:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-02-06 03:44:41,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:41,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462031260] [2025-02-06 03:44:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462031260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:41,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:41,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:41,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490122680] [2025-02-06 03:44:41,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:41,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:44:41,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:41,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:44:41,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:41,210 INFO L87 Difference]: Start difference. First operand 234 states and 333 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:44,357 INFO L93 Difference]: Finished difference Result 467 states and 665 transitions. [2025-02-06 03:44:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:44:44,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-02-06 03:44:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:44,362 INFO L225 Difference]: With dead ends: 467 [2025-02-06 03:44:44,362 INFO L226 Difference]: Without dead ends: 236 [2025-02-06 03:44:44,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:44:44,363 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 121 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:44,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 483 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-06 03:44:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-06 03:44:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-02-06 03:44:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 201 states have (on average 1.3482587064676617) internal successors, (271), 201 states have internal predecessors, (271), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 331 transitions. [2025-02-06 03:44:44,374 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 331 transitions. Word has length 132 [2025-02-06 03:44:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:44,374 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 331 transitions. [2025-02-06 03:44:44,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 331 transitions. [2025-02-06 03:44:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:44:44,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:44,376 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:44,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 03:44:44,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:44,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:44,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:44,577 INFO L85 PathProgramCache]: Analyzing trace with hash -787995891, now seen corresponding path program 1 times [2025-02-06 03:44:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:44,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199451227] [2025-02-06 03:44:44,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:44,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:44,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:44,580 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:44,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:44:44,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:44:44,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:44:44,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:44,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:44:44,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:45,117 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 77 treesize of output 41 [2025-02-06 03:44:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:44:45,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:44:45,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:45,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199451227] [2025-02-06 03:44:45,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199451227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:44:45,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:44:45,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:44:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430294519] [2025-02-06 03:44:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:44:45,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:44:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:45,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:44:45,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:44:45,136 INFO L87 Difference]: Start difference. First operand 234 states and 331 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:44:47,855 INFO L93 Difference]: Finished difference Result 467 states and 661 transitions. [2025-02-06 03:44:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:44:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-06 03:44:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:44:47,857 INFO L225 Difference]: With dead ends: 467 [2025-02-06 03:44:47,857 INFO L226 Difference]: Without dead ends: 236 [2025-02-06 03:44:47,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:44:47,858 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 99 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:44:47,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 479 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 03:44:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-06 03:44:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-02-06 03:44:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 201 states have (on average 1.3383084577114428) internal successors, (269), 201 states have internal predecessors, (269), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:44:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 329 transitions. [2025-02-06 03:44:47,872 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 329 transitions. Word has length 134 [2025-02-06 03:44:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:44:47,872 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 329 transitions. [2025-02-06 03:44:47,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:44:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 329 transitions. [2025-02-06 03:44:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:44:47,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:44:47,875 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:44:47,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:44:48,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:48,075 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:44:48,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:44:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash -755759413, now seen corresponding path program 1 times [2025-02-06 03:44:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:44:48,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121887391] [2025-02-06 03:44:48,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:44:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:44:48,078 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:44:48,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:44:48,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:44:48,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:44:48,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:48,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:48,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:44:48,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:49,844 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 18 treesize of output 19 [2025-02-06 03:44:50,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:44:50,069 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 203 treesize of output 133 [2025-02-06 03:44:50,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:44:50,075 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 288 treesize of output 138 [2025-02-06 03:44:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-06 03:44:50,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:44:50,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:44:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121887391] [2025-02-06 03:44:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121887391] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1630440458] [2025-02-06 03:44:50,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:44:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:44:50,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:44:50,578 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:44:50,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-02-06 03:44:50,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:44:51,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:44:51,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:44:51,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:44:52,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:44:52,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:44:52,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-02-06 03:44:55,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 03:44:55,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:44:55,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-02-06 03:44:55,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 142 [2025-02-06 03:44:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-06 03:44:55,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:44:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1630440458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:44:55,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:44:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-02-06 03:44:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147231787] [2025-02-06 03:44:55,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:44:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:44:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:44:55,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:44:55,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:44:55,650 INFO L87 Difference]: Start difference. First operand 234 states and 329 transitions. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-06 03:45:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:05,469 INFO L93 Difference]: Finished difference Result 700 states and 981 transitions. [2025-02-06 03:45:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:45:05,474 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 136 [2025-02-06 03:45:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:05,476 INFO L225 Difference]: With dead ends: 700 [2025-02-06 03:45:05,476 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 03:45:05,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:45:05,478 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 335 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:05,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1948 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 976 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-02-06 03:45:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 03:45:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 460. [2025-02-06 03:45:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 391 states have (on average 1.3324808184143222) internal successors, (521), 394 states have internal predecessors, (521), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:45:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 645 transitions. [2025-02-06 03:45:05,508 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 645 transitions. Word has length 136 [2025-02-06 03:45:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:05,509 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 645 transitions. [2025-02-06 03:45:05,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-06 03:45:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 645 transitions. [2025-02-06 03:45:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:45:05,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:05,512 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:45:05,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2025-02-06 03:45:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2025-02-06 03:45:05,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:45:05,913 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:05,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1396845556, now seen corresponding path program 1 times [2025-02-06 03:45:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388876268] [2025-02-06 03:45:05,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:05,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:45:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:05,916 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:45:05,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:45:06,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:45:06,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:45:06,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:06,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:06,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:45:06,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-06 03:45:06,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:45:06,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388876268] [2025-02-06 03:45:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388876268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:45:06,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:45:06,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:45:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016836138] [2025-02-06 03:45:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:45:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:45:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:45:06,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:45:06,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:45:06,243 INFO L87 Difference]: Start difference. First operand 460 states and 645 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:45:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:45:06,315 INFO L93 Difference]: Finished difference Result 912 states and 1280 transitions. [2025-02-06 03:45:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:45:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-02-06 03:45:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:45:06,320 INFO L225 Difference]: With dead ends: 912 [2025-02-06 03:45:06,320 INFO L226 Difference]: Without dead ends: 460 [2025-02-06 03:45:06,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:45:06,321 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:45:06,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:45:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-02-06 03:45:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-02-06 03:45:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 391 states have (on average 1.3273657289002558) internal successors, (519), 394 states have internal predecessors, (519), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:45:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 643 transitions. [2025-02-06 03:45:06,347 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 643 transitions. Word has length 136 [2025-02-06 03:45:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:45:06,347 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 643 transitions. [2025-02-06 03:45:06,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:45:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 643 transitions. [2025-02-06 03:45:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:45:06,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:45:06,348 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:45:06,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2025-02-06 03:45:06,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:45:06,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:45:06,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:45:06,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1898886647, now seen corresponding path program 1 times [2025-02-06 03:45:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:45:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910444979] [2025-02-06 03:45:06,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:06,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:45:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:45:06,551 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:45:06,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-02-06 03:45:06,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:45:07,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:45:07,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:07,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:07,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 03:45:07,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:08,328 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 18 treesize of output 19 [2025-02-06 03:45:08,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:45:08,514 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 203 treesize of output 133 [2025-02-06 03:45:08,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:45:08,523 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 286 treesize of output 136 [2025-02-06 03:45:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-06 03:45:08,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:45:08,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:45:08,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910444979] [2025-02-06 03:45:08,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910444979] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:45:08,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1070864103] [2025-02-06 03:45:08,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:45:08,860 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:45:08,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:45:08,861 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:45:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-02-06 03:45:09,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:45:10,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:45:10,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:45:10,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:45:10,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 03:45:10,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:45:10,539 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 47 treesize of output 23 [2025-02-06 03:45:10,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 03:45:42,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17