./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-65.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 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:49:26,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:49:26,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:49:26,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:49:26,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:49:26,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:49:26,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:49:26,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:49:26,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:49:26,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:49:26,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:49:26,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:49:26,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:49:26,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:49:26,263 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:49:26,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:49:26,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:49:26,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:49:26,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:49:26,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:26,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:26,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:26,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:26,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:49:26,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:26,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:49:26,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:49:26,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:49:26,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:49:26,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:49:26,267 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 -> 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 [2025-01-09 15:49:26,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:49:26,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:49:26,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:49:26,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:49:26,481 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:49:26,482 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-65.i [2025-01-09 15:49:27,694 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a1544ca4/31d2bafecb3f453284d0cb1d6d517a80/FLAGd37b5b202 [2025-01-09 15:49:27,971 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:49:27,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2025-01-09 15:49:27,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a1544ca4/31d2bafecb3f453284d0cb1d6d517a80/FLAGd37b5b202 [2025-01-09 15:49:28,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a1544ca4/31d2bafecb3f453284d0cb1d6d517a80 [2025-01-09 15:49:28,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:49:28,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:49:28,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:28,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:49:28,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:49:28,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28, skipping insertion in model container [2025-01-09 15:49:28,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:49:28,417 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-65.i[916,929] [2025-01-09 15:49:28,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:28,463 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:49:28,470 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-65.i[916,929] [2025-01-09 15:49:28,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:28,515 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:49:28,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28 WrapperNode [2025-01-09 15:49:28,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:28,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:28,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:49:28,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:49:28,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,561 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2025-01-09 15:49:28,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:28,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:49:28,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:49:28,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:49:28,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,590 INFO L175 MemorySlicer]: Split 123 memory accesses to 15 slices as follows [2, 9, 8, 20, 3, 8, 10, 10, 8, 8, 3, 6, 7, 8, 13]. 16 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 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:49:28,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:49:28,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:49:28,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:49:28,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:49:28,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (1/1) ... [2025-01-09 15:49:28,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:28,658 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-01-09 15:49:28,666 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-01-09 15:49:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:49:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:49:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:49:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:49:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:49:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:49:28,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:49:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:49:28,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-01-09 15:49:28,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-01-09 15:49:28,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-01-09 15:49:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:49:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:49:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:49:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:49:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:49:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:49:28,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-01-09 15:49:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:49:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:49:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-01-09 15:49:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-01-09 15:49:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:49:28,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 15:49:28,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:49:28,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:49:28,884 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:49:28,886 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:49:29,339 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-01-09 15:49:29,339 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:49:29,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:49:29,350 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:49:29,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:29 BoogieIcfgContainer [2025-01-09 15:49:29,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:49:29,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:49:29,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:49:29,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:49:29,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:49:28" (1/3) ... [2025-01-09 15:49:29,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304a5a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:29, skipping insertion in model container [2025-01-09 15:49:29,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:28" (2/3) ... [2025-01-09 15:49:29,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304a5a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:29, skipping insertion in model container [2025-01-09 15:49:29,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:29" (3/3) ... [2025-01-09 15:49:29,360 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-65.i [2025-01-09 15:49:29,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:49:29,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:49:29,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:49:29,429 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;@5f9a0dc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:49:29,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:49:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:29,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:29,438 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:29,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:29,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1645537726, now seen corresponding path program 1 times [2025-01-09 15:49:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:29,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869639059] [2025-01-09 15:49:29,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:29,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:29,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:29,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 15:49:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869639059] [2025-01-09 15:49:29,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869639059] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:29,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838763520] [2025-01-09 15:49:29,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:29,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:29,675 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-01-09 15:49:29,676 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-01-09 15:49:29,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:29,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:29,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:29,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:29,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:49:29,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 15:49:29,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:29,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838763520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:29,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:29,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:49:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510714353] [2025-01-09 15:49:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:29,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:49:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:29,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:49:29,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:49:29,949 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:29,966 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-01-09 15:49:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:49:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 15:49:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:29,973 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:49:29,974 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:49:29,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-01-09 15:49:29,979 INFO L435 NwaCegarLoop]: 157 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, 157 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-01-09 15:49:29,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:49:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:49:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 15:49:30,010 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-01-09 15:49:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 15:49:30,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 15:49:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:30,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:30,013 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:30,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:30,218 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-01-09 15:49:30,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1620700292, now seen corresponding path program 1 times [2025-01-09 15:49:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-01-09 15:49:30,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:30,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:30,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:30,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:30,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:30,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:30,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-01-09 15:49:30,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595382007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:30,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:30,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:49:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943847886] [2025-01-09 15:49:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:30,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:30,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:30,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:30,439 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:30,467 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2025-01-09 15:49:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:30,468 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), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 15:49:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:30,473 INFO L225 Difference]: With dead ends: 217 [2025-01-09 15:49:30,473 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:49:30,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:30,474 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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-01-09 15:49:30,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:49:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 15:49:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-01-09 15:49:30,506 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2025-01-09 15:49:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:30,507 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-01-09 15:49:30,507 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), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-01-09 15:49:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:30,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:30,508 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:30,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:49:30,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash 337874494, now seen corresponding path program 1 times [2025-01-09 15:49:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:30,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389441760] [2025-01-09 15:49:30,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:30,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:30,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:30,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:30,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 15:49:30,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:30,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389441760] [2025-01-09 15:49:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389441760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520782606] [2025-01-09 15:49:30,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:30,776 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-01-09 15:49:30,777 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-01-09 15:49:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:30,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:30,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:30,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:30,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:49:30,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:31,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520782606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:31,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:31,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 15:49:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243484104] [2025-01-09 15:49:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:31,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:31,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:31,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:31,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:31,042 INFO L87 Difference]: Start difference. First operand 111 states and 159 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:31,076 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2025-01-09 15:49:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:31,077 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 15:49:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:31,078 INFO L225 Difference]: With dead ends: 222 [2025-01-09 15:49:31,078 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:49:31,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:31,079 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 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-01-09 15:49:31,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:49:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-01-09 15:49:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-01-09 15:49:31,092 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 112 [2025-01-09 15:49:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:31,093 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-01-09 15:49:31,093 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-01-09 15:49:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:31,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:31,096 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:31,108 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-01-09 15:49:31,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:31,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1017932864, now seen corresponding path program 1 times [2025-01-09 15:49:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794775735] [2025-01-09 15:49:31,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:31,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:31,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:31,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:31,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:31,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 15:49:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794775735] [2025-01-09 15:49:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794775735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414424572] [2025-01-09 15:49:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:31,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:31,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:31,509 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-01-09 15:49:31,522 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-01-09 15:49:31,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:31,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:31,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:31,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:31,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:49:31,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:31,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414424572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 15:49:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705799384] [2025-01-09 15:49:31,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:31,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:31,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:31,816 INFO L87 Difference]: Start difference. First operand 113 states and 161 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:31,840 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2025-01-09 15:49:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:31,841 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 15:49:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:31,842 INFO L225 Difference]: With dead ends: 226 [2025-01-09 15:49:31,843 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:49:31,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:31,844 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 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-01-09 15:49:31,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:49:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-01-09 15:49:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-01-09 15:49:31,854 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 112 [2025-01-09 15:49:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:31,854 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-01-09 15:49:31,855 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-01-09 15:49:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:31,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:31,856 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:31,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:49:32,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:32,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:32,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1019779906, now seen corresponding path program 1 times [2025-01-09 15:49:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:32,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114876476] [2025-01-09 15:49:32,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:32,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:32,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:32,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:32,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 15:49:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114876476] [2025-01-09 15:49:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114876476] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837175973] [2025-01-09 15:49:32,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:32,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:32,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:32,200 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-01-09 15:49:32,201 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-01-09 15:49:32,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:32,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:32,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:32,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:32,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:49:32,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:32,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837175973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:32,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:32,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 15:49:32,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648145263] [2025-01-09 15:49:32,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:32,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:32,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:32,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:32,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:32,426 INFO L87 Difference]: Start difference. First operand 115 states and 163 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:32,473 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2025-01-09 15:49:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:32,474 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 15:49:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:32,474 INFO L225 Difference]: With dead ends: 230 [2025-01-09 15:49:32,474 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 15:49:32,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:32,475 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:32,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 15:49:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-01-09 15:49:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2025-01-09 15:49:32,482 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 112 [2025-01-09 15:49:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:32,485 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2025-01-09 15:49:32,485 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2025-01-09 15:49:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:32,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:32,486 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:32,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:32,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:32,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:32,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1692776268, now seen corresponding path program 1 times [2025-01-09 15:49:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078154244] [2025-01-09 15:49:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:32,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:32,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:32,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:32,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:49:32,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:49:32,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:32,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:32,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:49:32,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:49:32,859 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:49:32,865 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:49:32,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:49:32,870 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 15:49:33,019 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:49:33,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:49:33 BoogieIcfgContainer [2025-01-09 15:49:33,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:49:33,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:49:33,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:49:33,026 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:49:33,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:29" (3/4) ... [2025-01-09 15:49:33,029 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:49:33,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:49:33,030 INFO L158 Benchmark]: Toolchain (without parser) took 4741.55ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.7MB in the beginning and 235.1MB in the end (delta: -111.5MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2025-01-09 15:49:33,030 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:49:33,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.00ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 109.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:49:33,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.09ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 106.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:49:33,031 INFO L158 Benchmark]: Boogie Preprocessor took 67.85ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 101.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:49:33,031 INFO L158 Benchmark]: RCFGBuilder took 720.28ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 63.0MB in the end (delta: 38.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:49:33,031 INFO L158 Benchmark]: TraceAbstraction took 3672.47ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 62.3MB in the beginning and 235.2MB in the end (delta: -172.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:49:33,037 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 335.5MB. Free memory was 235.2MB in the beginning and 235.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:49:33,038 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.13ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.00ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 109.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.09ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 106.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.85ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 101.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 720.28ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 63.0MB in the end (delta: 38.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3672.47ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 62.3MB in the beginning and 235.2MB in the end (delta: -172.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 335.5MB. Free memory was 235.2MB in the beginning and 235.1MB in the end (delta: 33.1kB). 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 102, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someUnaryFLOAToperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 1000000000.1; [L22] float var_1_1 = 1000000000.1; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] float var_1_4 = 8.2; [L26] float var_1_4 = 8.2; [L27] float* var_1_4_Pointer = &(var_1_4); [L28] signed long int var_1_5 = -32; [L28] signed long int var_1_5 = -32; [L29] signed long int* var_1_5_Pointer = &(var_1_5); [L30] double var_1_9 = 100.5; [L30] double var_1_9 = 100.5; [L31] double* var_1_9_Pointer = &(var_1_9); [L32] double var_1_12 = 25.25; [L32] double var_1_12 = 25.25; [L33] double* var_1_12_Pointer = &(var_1_12); [L34] double var_1_13 = 63.6; [L34] double var_1_13 = 63.6; [L35] double* var_1_13_Pointer = &(var_1_13); [L36] double var_1_14 = 0.0; [L36] double var_1_14 = 0.0; [L37] double* var_1_14_Pointer = &(var_1_14); [L38] double var_1_15 = 0.8; [L38] double var_1_15 = 0.8; [L39] double* var_1_15_Pointer = &(var_1_15); [L40] signed char var_1_16 = -8; [L40] signed char var_1_16 = -8; [L41] signed char* var_1_16_Pointer = &(var_1_16); [L42] signed char var_1_17 = 8; [L42] signed char var_1_17 = 8; [L43] signed char* var_1_17_Pointer = &(var_1_17); [L44] unsigned short int var_1_18 = 2; [L44] unsigned short int var_1_18 = 2; [L45] unsigned short int* var_1_18_Pointer = &(var_1_18); [L46] unsigned short int var_1_19 = 50; [L46] unsigned short int var_1_19 = 50; [L47] unsigned short int* var_1_19_Pointer = &(var_1_19); [L48] unsigned short int var_1_20 = 0; [L48] unsigned short int var_1_20 = 0; [L49] unsigned short int* var_1_20_Pointer = &(var_1_20); [L50] double last_1_var_1_9 = 100.5; VAL [isInitial=0, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] isInitial = 1 [L107] FCALL initially() [L109] CALL updateLastVariables() [L99] EXPR \read(var_1_9) [L99] last_1_var_1_9 = var_1_9 [L109] RET updateLastVariables() [L110] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_uchar() [L79] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] var_1_4 = __VERIFIER_nondet_float() [L82] EXPR \read(var_1_4) [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F [L82] EXPR \read(var_1_4) [L82] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] var_1_12 = __VERIFIER_nondet_double() [L84] EXPR \read(var_1_12) [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L84] EXPR \read(var_1_12) [L84] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] 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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR (var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR (var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] var_1_17 = __VERIFIER_nondet_char() [L92] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] var_1_19 = __VERIFIER_nondet_ushort() [L95] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_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_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L110] RET updateVariables() [L111] CALL step() [L54] COND TRUE 0.625f > last_1_var_1_9 [L55] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L55] COND FALSE !((*(var_1_3_Pointer))) [L61] EXPR \read(*var_1_17_Pointer) [L61] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L62] EXPR \read(*var_1_19_Pointer) [L62] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L63] EXPR \read(*var_1_19_Pointer) [L63] (*(var_1_20_Pointer)) = (*(var_1_19_Pointer)) [L64] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L64] COND FALSE !((*(var_1_3_Pointer))) [L69] EXPR \read(*var_1_1_Pointer) [L69] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L69] COND FALSE !((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) [L73] EXPR \read(*var_1_4_Pointer) [L73] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L73] COND FALSE !((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR (0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))) [L102] EXPR \read(*var_1_4_Pointer) [L102] EXPR (((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR (((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] EXPR ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102-L103] return ((((((0.625f > last_1_var_1_9) ? ((*(var_1_3_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer)))))))) && (((*(var_1_4_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_5_Pointer)) == ((signed long int) ((((((*(var_1_20_Pointer))) > (-64)) ? ((*(var_1_20_Pointer))) : (-64))) + (((*(var_1_20_Pointer)) + -2) + (*(var_1_18_Pointer)))))) : 1)) && ((*(var_1_3_Pointer)) ? (((*(var_1_20_Pointer)) >= (((*(var_1_18_Pointer)) - (*(var_1_20_Pointer))) * 64)) ? ((*(var_1_9_Pointer)) == ((double) ((((((*(var_1_12_Pointer))) < (50.5)) ? ((*(var_1_12_Pointer))) : (50.5))) - (*(var_1_13_Pointer))))) : 1) : (((*(var_1_1_Pointer)) <= (*(var_1_1_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) ((*(var_1_13_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : 1))) && ((*(var_1_16_Pointer)) == ((signed char) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_17={14:0}, var_1_17_Pointer={14:0}, var_1_18={15:0}, var_1_18_Pointer={15:0}, var_1_19={16:0}, var_1_19_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={17:0}, var_1_20_Pointer={17:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 2117 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1343 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 774 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2087 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1870/1980 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-01-09 15:49:33,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.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 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:49:34,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:49:34,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:49:34,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:49:34,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:49:34,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:49:34,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:49:34,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:49:34,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:49:34,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:49:34,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:49:34,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:49:34,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:49:34,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:49:34,982 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:49:34,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:49:34,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:34,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:34,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:34,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:49:34,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:49:34,984 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 -> 187e608dd7eb0d2f9c48e42a2102391c335d64a7aaf23ffbd5cb60332049f233 [2025-01-09 15:49:35,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:49:35,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:49:35,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:49:35,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:49:35,221 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:49:35,222 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-65.i [2025-01-09 15:49:36,425 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5cd7b016/b4b4c0da12c148768b82330511459d2a/FLAG9dab5b87c [2025-01-09 15:49:36,680 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:49:36,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-65.i [2025-01-09 15:49:36,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5cd7b016/b4b4c0da12c148768b82330511459d2a/FLAG9dab5b87c [2025-01-09 15:49:37,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5cd7b016/b4b4c0da12c148768b82330511459d2a [2025-01-09 15:49:37,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:49:37,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:49:37,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:37,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:49:37,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:49:37,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce5a03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37, skipping insertion in model container [2025-01-09 15:49:37,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:49:37,142 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-65.i[916,929] [2025-01-09 15:49:37,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:37,222 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:49:37,230 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-65.i[916,929] [2025-01-09 15:49:37,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:37,266 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:49:37,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37 WrapperNode [2025-01-09 15:49:37,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:37,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:37,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:49:37,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:49:37,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,323 INFO L138 Inliner]: procedures = 39, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 516 [2025-01-09 15:49:37,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:37,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:49:37,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:49:37,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:49:37,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,380 INFO L175 MemorySlicer]: Split 123 memory accesses to 15 slices as follows [2, 9, 8, 20, 3, 8, 10, 10, 8, 8, 3, 6, 7, 8, 13]. 16 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 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:49:37,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:49:37,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:49:37,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:49:37,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:49:37,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (1/1) ... [2025-01-09 15:49:37,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:37,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:37,489 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-01-09 15:49:37,497 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-01-09 15:49:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:49:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:49:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:49:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:49:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-01-09 15:49:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-01-09 15:49:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-01-09 15:49:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:49:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:49:37,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:49:37,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:49:37,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:49:37,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-01-09 15:49:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:49:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:49:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:49:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:49:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:49:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:49:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:49:37,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:49:37,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:49:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:49:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:49:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:49:37,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-01-09 15:49:37,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-01-09 15:49:37,761 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:49:37,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:49:40,059 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-01-09 15:49:40,059 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:49:40,068 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:49:40,072 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:49:40,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:40 BoogieIcfgContainer [2025-01-09 15:49:40,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:49:40,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:49:40,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:49:40,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:49:40,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:49:37" (1/3) ... [2025-01-09 15:49:40,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8695939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:40, skipping insertion in model container [2025-01-09 15:49:40,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:37" (2/3) ... [2025-01-09 15:49:40,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8695939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:40, skipping insertion in model container [2025-01-09 15:49:40,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:40" (3/3) ... [2025-01-09 15:49:40,078 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-65.i [2025-01-09 15:49:40,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:49:40,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:49:40,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:49:40,132 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;@137c64b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:49:40,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:49:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:40,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:40,141 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:40,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:40,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1645537726, now seen corresponding path program 1 times [2025-01-09 15:49:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:40,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588252964] [2025-01-09 15:49:40,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:40,152 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-01-09 15:49:40,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:40,155 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-01-09 15:49:40,157 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-01-09 15:49:40,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:40,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:40,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:40,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:40,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:49:40,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 15:49:40,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:40,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:40,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588252964] [2025-01-09 15:49:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588252964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:40,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:40,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:49:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564638538] [2025-01-09 15:49:40,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:40,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:49:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:40,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:49:40,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:49:40,676 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:40,693 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-01-09 15:49:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:49:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 15:49:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:40,699 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:49:40,699 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:49:40,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-01-09 15:49:40,703 INFO L435 NwaCegarLoop]: 157 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, 157 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-01-09 15:49:40,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:49:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:49:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 15:49:40,739 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-01-09 15:49:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:40,739 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 15:49:40,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 15:49:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:40,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:40,742 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:40,752 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-01-09 15:49:40,942 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-01-09 15:49:40,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:40,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:40,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1620700292, now seen corresponding path program 1 times [2025-01-09 15:49:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:40,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495505243] [2025-01-09 15:49:40,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:40,944 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-01-09 15:49:40,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:40,946 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-01-09 15:49:40,948 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-01-09 15:49:41,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:41,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:41,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:41,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:41,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:49:41,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:49:41,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:41,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:41,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495505243] [2025-01-09 15:49:41,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495505243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:41,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:41,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:49:41,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37921591] [2025-01-09 15:49:41,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:41,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:41,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:41,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:41,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:41,421 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:41,481 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2025-01-09 15:49:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:41,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 15:49:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:41,485 INFO L225 Difference]: With dead ends: 217 [2025-01-09 15:49:41,485 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:49:41,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 109 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-01-09 15:49:41,486 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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-01-09 15:49:41,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:49:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 15:49:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:49:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-01-09 15:49:41,502 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2025-01-09 15:49:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:41,503 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-01-09 15:49:41,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:49:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-01-09 15:49:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:49:41,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:41,504 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:41,518 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-01-09 15:49:41,705 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-01-09 15:49:41,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:41,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash 337874494, now seen corresponding path program 1 times [2025-01-09 15:49:41,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:41,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444904867] [2025-01-09 15:49:41,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:41,707 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-01-09 15:49:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:41,709 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-01-09 15:49:41,710 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-01-09 15:49:41,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:49:42,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:49:42,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:42,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:42,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:49:42,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:42,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:49:42,213 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 56 treesize of output 20 [2025-01-09 15:49:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:43,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:43,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444904867] [2025-01-09 15:49:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444904867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:43,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:49:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137619902] [2025-01-09 15:49:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:43,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:43,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:43,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:43,012 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:44,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:49:46,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:49:47,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:49:50,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:49:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:51,258 INFO L93 Difference]: Finished difference Result 357 states and 510 transitions. [2025-01-09 15:49:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 15:49:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:51,267 INFO L225 Difference]: With dead ends: 357 [2025-01-09 15:49:51,267 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 15:49:51,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-01-09 15:49:51,268 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 254 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:51,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 330 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2025-01-09 15:49:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 15:49:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 216. [2025-01-09 15:49:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 191 states have (on average 1.382198952879581) internal successors, (264), 191 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:49:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 308 transitions. [2025-01-09 15:49:51,282 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 308 transitions. Word has length 112 [2025-01-09 15:49:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:51,282 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 308 transitions. [2025-01-09 15:49:51,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 308 transitions. [2025-01-09 15:49:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:51,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:51,284 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:51,295 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:51,488 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-01-09 15:49:51,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2124220216, now seen corresponding path program 1 times [2025-01-09 15:49:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:51,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365109949] [2025-01-09 15:49:51,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:51,490 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-01-09 15:49:51,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:51,496 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-01-09 15:49:51,498 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-01-09 15:49:51,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:51,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:51,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:51,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:51,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:49:51,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:51,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:51,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365109949] [2025-01-09 15:49:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365109949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:51,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:51,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:51,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832212625] [2025-01-09 15:49:51,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:51,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:51,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:51,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:51,879 INFO L87 Difference]: Start difference. First operand 216 states and 308 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:51,928 INFO L93 Difference]: Finished difference Result 439 states and 627 transitions. [2025-01-09 15:49:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 15:49:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:51,930 INFO L225 Difference]: With dead ends: 439 [2025-01-09 15:49:51,930 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 15:49:51,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-01-09 15:49:51,931 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 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-01-09 15:49:51,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 15:49:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2025-01-09 15:49:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 199 states have internal predecessors, (272), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:49:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 316 transitions. [2025-01-09 15:49:51,951 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 316 transitions. Word has length 113 [2025-01-09 15:49:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:51,951 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 316 transitions. [2025-01-09 15:49:51,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 316 transitions. [2025-01-09 15:49:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:51,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:51,956 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:51,975 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-01-09 15:49:52,156 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-01-09 15:49:52,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:52,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:52,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1444161846, now seen corresponding path program 1 times [2025-01-09 15:49:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:52,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625002392] [2025-01-09 15:49:52,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:52,158 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-01-09 15:49:52,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:52,160 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-01-09 15:49:52,161 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-01-09 15:49:52,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:52,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:52,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:52,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:52,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:49:52,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:52,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:52,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625002392] [2025-01-09 15:49:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625002392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:52,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:52,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:49:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746671376] [2025-01-09 15:49:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:52,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:52,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:52,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:52,565 INFO L87 Difference]: Start difference. First operand 224 states and 316 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:52,635 INFO L93 Difference]: Finished difference Result 455 states and 643 transitions. [2025-01-09 15:49:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 15:49:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:52,638 INFO L225 Difference]: With dead ends: 455 [2025-01-09 15:49:52,638 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 15:49:52,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:52,639 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:52,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 15:49:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2025-01-09 15:49:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 207 states have internal predecessors, (280), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:49:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2025-01-09 15:49:52,649 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 113 [2025-01-09 15:49:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:52,650 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2025-01-09 15:49:52,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2025-01-09 15:49:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:52,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:52,651 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:52,663 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-01-09 15:49:52,851 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-01-09 15:49:52,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:52,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1442314804, now seen corresponding path program 1 times [2025-01-09 15:49:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460418234] [2025-01-09 15:49:52,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:52,852 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-01-09 15:49:52,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:52,855 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-01-09 15:49:52,856 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-01-09 15:49:53,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:53,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:53,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:53,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:53,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:49:53,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:53,268 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 46 treesize of output 22 [2025-01-09 15:49:53,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:49:53,385 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 71 treesize of output 35 [2025-01-09 15:49:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:53,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:53,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:53,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460418234] [2025-01-09 15:49:53,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460418234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:53,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:53,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:49:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155959173] [2025-01-09 15:49:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:53,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:49:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:53,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:49:53,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:53,467 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:54,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:49:55,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:49:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:56,377 INFO L93 Difference]: Finished difference Result 694 states and 970 transitions. [2025-01-09 15:49:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 15:49:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:56,380 INFO L225 Difference]: With dead ends: 694 [2025-01-09 15:49:56,380 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 15:49:56,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:56,381 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 152 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:56,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 716 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 15:49:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 15:49:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 356. [2025-01-09 15:49:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 319 states have (on average 1.35423197492163) internal successors, (432), 319 states have internal predecessors, (432), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 15:49:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 498 transitions. [2025-01-09 15:49:56,395 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 498 transitions. Word has length 113 [2025-01-09 15:49:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:56,395 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 498 transitions. [2025-01-09 15:49:56,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 498 transitions. [2025-01-09 15:49:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:49:56,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:56,397 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:56,409 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 (7)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:56,601 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-01-09 15:49:56,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:56,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1865016630, now seen corresponding path program 1 times [2025-01-09 15:49:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107076518] [2025-01-09 15:49:56,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:56,602 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-01-09 15:49:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:56,604 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-01-09 15:49:56,606 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-01-09 15:49:56,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:49:57,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:49:57,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:57,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:49:57,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:57,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:49:57,349 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 62 treesize of output 38 [2025-01-09 15:49:57,418 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 74 treesize of output 38 [2025-01-09 15:49:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:49:57,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:57,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107076518] [2025-01-09 15:49:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107076518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:57,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:49:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808140690] [2025-01-09 15:49:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:57,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:57,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:57,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:57,684 INFO L87 Difference]: Start difference. First operand 356 states and 498 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:49:59,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:50:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:00,379 INFO L93 Difference]: Finished difference Result 831 states and 1150 transitions. [2025-01-09 15:50:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:50:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 15:50:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:00,382 INFO L225 Difference]: With dead ends: 831 [2025-01-09 15:50:00,382 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 15:50:00,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:50:00,382 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 73 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:00,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1309 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 15:50:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 15:50:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 474. [2025-01-09 15:50:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 431 states have (on average 1.3364269141531322) internal successors, (576), 433 states have internal predecessors, (576), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 15:50:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 650 transitions. [2025-01-09 15:50:00,399 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 650 transitions. Word has length 113 [2025-01-09 15:50:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 650 transitions. [2025-01-09 15:50:00,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:50:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 650 transitions. [2025-01-09 15:50:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:50:00,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:00,401 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:00,417 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-01-09 15:50:00,605 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-01-09 15:50:00,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1408882312, now seen corresponding path program 1 times [2025-01-09 15:50:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778106018] [2025-01-09 15:50:00,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:00,606 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-01-09 15:50:00,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:00,608 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-01-09 15:50:00,610 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-01-09 15:50:00,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:50:01,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:50:01,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:01,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:01,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:50:01,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:01,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-01-09 15:50:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:50:01,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:01,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:50:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778106018] [2025-01-09 15:50:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778106018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833217163] [2025-01-09 15:50:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:01,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:50:01,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:01,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:01,178 INFO L87 Difference]: Start difference. First operand 474 states and 650 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:50:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:05,047 INFO L93 Difference]: Finished difference Result 943 states and 1293 transitions. [2025-01-09 15:50:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:05,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 15:50:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:05,050 INFO L225 Difference]: With dead ends: 943 [2025-01-09 15:50:05,051 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 15:50:05,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:05,052 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 67 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:05,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 551 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 15:50:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 15:50:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2025-01-09 15:50:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 425 states have (on average 1.3341176470588236) internal successors, (567), 427 states have internal predecessors, (567), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 15:50:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 641 transitions. [2025-01-09 15:50:05,075 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 641 transitions. Word has length 113 [2025-01-09 15:50:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:05,076 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 641 transitions. [2025-01-09 15:50:05,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:50:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 641 transitions. [2025-01-09 15:50:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:50:05,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:05,078 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:05,094 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 (9)] Forceful destruction successful, exit code 0 [2025-01-09 15:50:05,278 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-01-09 15:50:05,279 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:05,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1301766194, now seen corresponding path program 1 times [2025-01-09 15:50:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:05,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904352658] [2025-01-09 15:50:05,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:05,280 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-01-09 15:50:05,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:05,282 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-01-09 15:50:05,283 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-01-09 15:50:05,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:50:05,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:50:05,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:05,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:05,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:50:05,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:05,749 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 46 treesize of output 22 [2025-01-09 15:50:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:50:05,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:05,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:50:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904352658] [2025-01-09 15:50:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904352658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:05,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:05,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:05,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361441539] [2025-01-09 15:50:05,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:05,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:50:05,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:05,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:05,781 INFO L87 Difference]: Start difference. First operand 468 states and 641 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:50:07,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:50:10,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:50:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:11,501 INFO L93 Difference]: Finished difference Result 1002 states and 1367 transitions. [2025-01-09 15:50:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 15:50:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:11,505 INFO L225 Difference]: With dead ends: 1002 [2025-01-09 15:50:11,505 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 15:50:11,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:11,506 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 70 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:11,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 579 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 15:50:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 15:50:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 494. [2025-01-09 15:50:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 450 states have (on average 1.3333333333333333) internal successors, (600), 452 states have internal predecessors, (600), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 15:50:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 674 transitions. [2025-01-09 15:50:11,527 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 674 transitions. Word has length 113 [2025-01-09 15:50:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:11,527 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 674 transitions. [2025-01-09 15:50:11,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:50:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 674 transitions. [2025-01-09 15:50:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:50:11,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:11,528 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:11,540 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 (10)] Ended with exit code 0 [2025-01-09 15:50:11,729 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-01-09 15:50:11,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:11,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1972132748, now seen corresponding path program 1 times [2025-01-09 15:50:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551909962] [2025-01-09 15:50:11,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:11,731 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-01-09 15:50:11,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:11,733 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-01-09 15:50:11,735 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-01-09 15:50:11,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:50:12,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:50:12,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:12,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:12,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:50:12,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:13,355 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 70 treesize of output 34 [2025-01-09 15:50:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 15:50:13,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:50:13,925 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:50:13,925 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 74 treesize of output 45 [2025-01-09 15:50:14,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:50:14,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551909962] [2025-01-09 15:50:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551909962] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:50:14,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1696052984] [2025-01-09 15:50:14,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:14,132 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:50:14,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:50:14,134 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:50:14,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-01-09 15:50:14,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:50:15,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:50:15,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:15,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:15,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:50:15,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:15,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:50:15,617 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 155 treesize of output 65 [2025-01-09 15:50:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:50:15,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:15,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1696052984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:15,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:50:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-01-09 15:50:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503441552] [2025-01-09 15:50:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:15,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:50:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:50:15,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:50:15,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:50:15,696 INFO L87 Difference]: Start difference. First operand 494 states and 674 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:50:18,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:50:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:18,862 INFO L93 Difference]: Finished difference Result 985 states and 1345 transitions. [2025-01-09 15:50:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-01-09 15:50:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:18,865 INFO L225 Difference]: With dead ends: 985 [2025-01-09 15:50:18,865 INFO L226 Difference]: Without dead ends: 494 [2025-01-09 15:50:18,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:50:18,866 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 138 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:18,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 408 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 15:50:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-01-09 15:50:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2025-01-09 15:50:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 444 states have (on average 1.3310810810810811) internal successors, (591), 446 states have internal predecessors, (591), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 15:50:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 665 transitions. [2025-01-09 15:50:18,879 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 665 transitions. Word has length 113 [2025-01-09 15:50:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:18,880 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 665 transitions. [2025-01-09 15:50:18,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:50:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 665 transitions. [2025-01-09 15:50:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:50:18,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:18,881 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:18,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-01-09 15:50:19,096 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-01-09 15:50:19,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-01-09 15:50:19,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:19,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:19,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1834933644, now seen corresponding path program 1 times [2025-01-09 15:50:19,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:19,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836283759] [2025-01-09 15:50:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:19,286 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-01-09 15:50:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:19,289 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-01-09 15:50:19,290 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-01-09 15:50:19,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:50:19,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:50:19,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:19,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:19,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:50:19,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:20,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 70 treesize of output 34 [2025-01-09 15:50:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 15:50:20,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:50:21,076 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:50:21,077 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 74 treesize of output 45 [2025-01-09 15:50:21,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:50:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836283759] [2025-01-09 15:50:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836283759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:50:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28669675] [2025-01-09 15:50:21,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:21,236 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:50:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:50:21,238 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:50:21,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-01-09 15:50:21,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:50:22,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:50:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:22,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:50:22,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:22,978 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 21 treesize of output 10 [2025-01-09 15:50:23,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:50:23,478 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 213 treesize of output 87 [2025-01-09 15:50:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 12 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 15:50:23,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:50:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 15:50:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [28669675] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:50:24,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:50:24,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 20 [2025-01-09 15:50:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398085031] [2025-01-09 15:50:24,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:50:24,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 15:50:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:50:24,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 15:50:24,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:50:24,853 INFO L87 Difference]: Start difference. First operand 488 states and 665 transitions. Second operand has 20 states, 19 states have (on average 6.894736842105263) internal successors, (131), 20 states have internal predecessors, (131), 6 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2025-01-09 15:50:29,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:50:33,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:50:38,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:50:43,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:50:45,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:50:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:50,077 INFO L93 Difference]: Finished difference Result 1456 states and 1966 transitions. [2025-01-09 15:50:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 15:50:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.894736842105263) internal successors, (131), 20 states have internal predecessors, (131), 6 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) Word has length 115 [2025-01-09 15:50:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:50,087 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 15:50:50,087 INFO L226 Difference]: Without dead ends: 899 [2025-01-09 15:50:50,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=551, Invalid=2871, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 15:50:50,089 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 433 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:50,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1515 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1418 Invalid, 1 Unknown, 0 Unchecked, 22.4s Time] [2025-01-09 15:50:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-01-09 15:50:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 746. [2025-01-09 15:50:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 668 states have (on average 1.3218562874251496) internal successors, (883), 672 states have internal predecessors, (883), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1019 transitions. [2025-01-09 15:50:50,124 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1019 transitions. Word has length 115 [2025-01-09 15:50:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:50,124 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1019 transitions. [2025-01-09 15:50:50,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.894736842105263) internal successors, (131), 20 states have internal predecessors, (131), 6 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2025-01-09 15:50:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1019 transitions. [2025-01-09 15:50:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:50:50,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:50,126 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:50,152 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 (13)] Forceful destruction successful, exit code 0 [2025-01-09 15:50:50,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2025-01-09 15:50:50,526 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,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:50:50,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:50,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1324363952, now seen corresponding path program 1 times [2025-01-09 15:50:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63979505] [2025-01-09 15:50:50,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:50:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:50,530 INFO L229 MonitoredProcess]: Starting monitored process 15 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-01-09 15:50:50,532 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 (15)] Waiting until timeout for monitored process [2025-01-09 15:50:50,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:50:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:50:50,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:50,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:50:50,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 15:50:50,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:50,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:50:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63979505] [2025-01-09 15:50:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63979505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:50,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:50:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147012939] [2025-01-09 15:50:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:50,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:50:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:50:50,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:50:50,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:50:50,912 INFO L87 Difference]: Start difference. First operand 746 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:50:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:50,984 INFO L93 Difference]: Finished difference Result 1489 states and 2035 transitions. [2025-01-09 15:50:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:50:50,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-01-09 15:50:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:50,991 INFO L225 Difference]: With dead ends: 1489 [2025-01-09 15:50:50,991 INFO L226 Difference]: Without dead ends: 746 [2025-01-09 15:50:50,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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-01-09 15:50:50,993 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-01-09 15:50:50,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-01-09 15:50:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2025-01-09 15:50:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 668 states have (on average 1.3173652694610778) internal successors, (880), 672 states have internal predecessors, (880), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1016 transitions. [2025-01-09 15:50:51,026 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1016 transitions. Word has length 115 [2025-01-09 15:50:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:51,026 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1016 transitions. [2025-01-09 15:50:51,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:50:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1016 transitions. [2025-01-09 15:50:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:50:51,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:51,029 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:51,040 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 (15)] Ended with exit code 0 [2025-01-09 15:50:51,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-01-09 15:50:51,230 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:51,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1082201854, now seen corresponding path program 1 times [2025-01-09 15:50:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582644610] [2025-01-09 15:50:51,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:51,231 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-01-09 15:50:51,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:51,233 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-01-09 15:50:51,234 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-01-09 15:50:51,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:50:51,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:50:51,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:51,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:51,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:50:51,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:50:51,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:51,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:50:51,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582644610] [2025-01-09 15:50:51,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582644610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:51,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:51,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:51,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16423527] [2025-01-09 15:50:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:51,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:51,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:50:51,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:51,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:51,745 INFO L87 Difference]: Start difference. First operand 746 states and 1016 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:50:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:51,789 INFO L93 Difference]: Finished difference Result 1510 states and 2057 transitions. [2025-01-09 15:50:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 117 [2025-01-09 15:50:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:51,792 INFO L225 Difference]: With dead ends: 1510 [2025-01-09 15:50:51,792 INFO L226 Difference]: Without dead ends: 767 [2025-01-09 15:50:51,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-01-09 15:50:51,794 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:51,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-01-09 15:50:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2025-01-09 15:50:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 689 states have (on average 1.3076923076923077) internal successors, (901), 693 states have internal predecessors, (901), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1037 transitions. [2025-01-09 15:50:51,820 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1037 transitions. Word has length 117 [2025-01-09 15:50:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:51,821 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1037 transitions. [2025-01-09 15:50:51,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:50:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1037 transitions. [2025-01-09 15:50:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:50:51,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:51,822 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:51,838 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 (16)] Ended with exit code 0 [2025-01-09 15:50:52,022 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-01-09 15:50:52,023 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:52,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1628915252, now seen corresponding path program 1 times [2025-01-09 15:50:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:52,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858603260] [2025-01-09 15:50:52,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:52,023 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-01-09 15:50:52,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:52,025 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-01-09 15:50:52,028 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-01-09 15:50:52,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:50:52,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:50:52,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:52,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:52,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:50:52,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:53,416 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 68 treesize of output 32 [2025-01-09 15:50:53,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:50:53,529 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 70 treesize of output 34 [2025-01-09 15:50:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 15:50:53,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:50:53,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:50:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858603260] [2025-01-09 15:50:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858603260] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:50:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942528353] [2025-01-09 15:50:53,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:53,838 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:50:53,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:50:53,841 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-01-09 15:50:53,842 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-01-09 15:50:54,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:50:55,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:50:55,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:55,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:55,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:50:55,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:55,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:50:55,542 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 155 treesize of output 65 [2025-01-09 15:50:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 15:50:55,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [942528353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:50:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-01-09 15:50:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841624735] [2025-01-09 15:50:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:55,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:50:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:50:55,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:50:55,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:50:55,635 INFO L87 Difference]: Start difference. First operand 767 states and 1037 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:50:58,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:50:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:59,234 INFO L93 Difference]: Finished difference Result 1537 states and 2077 transitions. [2025-01-09 15:50:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-01-09 15:50:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:59,237 INFO L225 Difference]: With dead ends: 1537 [2025-01-09 15:50:59,237 INFO L226 Difference]: Without dead ends: 773 [2025-01-09 15:50:59,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:50:59,246 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 123 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:59,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 398 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 15:50:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-01-09 15:50:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 767. [2025-01-09 15:50:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 689 states have (on average 1.2989840348330914) internal successors, (895), 693 states have internal predecessors, (895), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:50:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1031 transitions. [2025-01-09 15:50:59,273 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1031 transitions. Word has length 117 [2025-01-09 15:50:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:59,274 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1031 transitions. [2025-01-09 15:50:59,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:50:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1031 transitions. [2025-01-09 15:50:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:50:59,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:59,275 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:50:59,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-01-09 15:50:59,487 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 (17)] Ended with exit code 0 [2025-01-09 15:50:59,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /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-01-09 15:50:59,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:59,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1322283098, now seen corresponding path program 1 times [2025-01-09 15:50:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:50:59,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708064578] [2025-01-09 15:50:59,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:59,681 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-01-09 15:50:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:50:59,684 INFO L229 MonitoredProcess]: Starting monitored process 19 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-01-09 15:50:59,685 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 (19)] Waiting until timeout for monitored process [2025-01-09 15:50:59,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:51:00,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:51:00,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:00,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:00,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:51:00,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:00,893 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 68 treesize of output 32 [2025-01-09 15:51:00,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:51:01,026 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 70 treesize of output 34 [2025-01-09 15:51:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 15:51:01,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:01,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708064578] [2025-01-09 15:51:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708064578] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:51:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1619120134] [2025-01-09 15:51:01,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:01,478 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:51:01,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:51:01,483 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:51:01,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-01-09 15:51:01,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:51:02,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:51:02,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:02,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:03,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:51:03,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:03,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:51:03,378 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 157 treesize of output 67 [2025-01-09 15:51:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:51:03,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:51:03,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1619120134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:51:03,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:51:03,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-01-09 15:51:03,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878145656] [2025-01-09 15:51:03,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:51:03,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:51:03,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:51:03,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:51:03,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:51:03,439 INFO L87 Difference]: Start difference. First operand 767 states and 1031 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:51:06,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:51:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:51:07,454 INFO L93 Difference]: Finished difference Result 1537 states and 2065 transitions. [2025-01-09 15:51:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:51:07,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2025-01-09 15:51:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:51:07,457 INFO L225 Difference]: With dead ends: 1537 [2025-01-09 15:51:07,457 INFO L226 Difference]: Without dead ends: 773 [2025-01-09 15:51:07,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:51:07,460 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:51:07,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 394 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 15:51:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-01-09 15:51:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 767. [2025-01-09 15:51:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 689 states have (on average 1.2902757619738752) internal successors, (889), 693 states have internal predecessors, (889), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:51:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1025 transitions. [2025-01-09 15:51:07,481 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1025 transitions. Word has length 119 [2025-01-09 15:51:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:51:07,482 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1025 transitions. [2025-01-09 15:51:07,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:51:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1025 transitions. [2025-01-09 15:51:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:51:07,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:51:07,483 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:51:07,494 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 (19)] Forceful destruction successful, exit code 0 [2025-01-09 15:51:07,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-01-09 15:51:07,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:51:07,888 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:51:07,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:51:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1515046924, now seen corresponding path program 1 times [2025-01-09 15:51:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:51:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125622471] [2025-01-09 15:51:07,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:07,889 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-01-09 15:51:07,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:51:07,895 INFO L229 MonitoredProcess]: Starting monitored process 21 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-01-09 15:51:07,900 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 (21)] Waiting until timeout for monitored process [2025-01-09 15:51:08,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:51:08,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:51:08,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:51:08,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:51:08,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:51:08,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:51:09,071 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 68 treesize of output 32 [2025-01-09 15:51:09,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:51:09,209 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 70 treesize of output 34 [2025-01-09 15:51:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 15:51:09,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:51:09,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:51:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125622471] [2025-01-09 15:51:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125622471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:51:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1223336734] [2025-01-09 15:51:09,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:51:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:51:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:51:09,550 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:51:09,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2025-01-09 15:51:09,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.