./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.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-24.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 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:43:59,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:43:59,282 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:43:59,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:43:59,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:43:59,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:43:59,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:43:59,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:43:59,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:43:59,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:43:59,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:43:59,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:43:59,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:43:59,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:43:59,334 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:43:59,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:43:59,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:43:59,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:43:59,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:43:59,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:43:59,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:43:59,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:43:59,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:43:59,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:59,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:43:59,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:43:59,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:43:59,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:43:59,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:43:59,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:43:59,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:43:59,338 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 -> 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 [2025-01-09 15:43:59,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:43:59,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:43:59,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:43:59,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:43:59,646 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:43:59,648 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-24.i [2025-01-09 15:44:00,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff599894/3aae73feb40549b0a82ea5e21c00a4a0/FLAG409ba991a [2025-01-09 15:44:01,206 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:44:01,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i [2025-01-09 15:44:01,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff599894/3aae73feb40549b0a82ea5e21c00a4a0/FLAG409ba991a [2025-01-09 15:44:01,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff599894/3aae73feb40549b0a82ea5e21c00a4a0 [2025-01-09 15:44:01,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:44:01,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:44:01,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:01,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:44:01,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:44:01,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01, skipping insertion in model container [2025-01-09 15:44:01,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:44:01,396 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-24.i[916,929] [2025-01-09 15:44:01,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:01,484 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:44:01,494 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-24.i[916,929] [2025-01-09 15:44:01,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:01,555 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:44:01,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01 WrapperNode [2025-01-09 15:44:01,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:01,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:01,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:44:01,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:44:01,565 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:44:01" (1/1) ... [2025-01-09 15:44:01,578 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:44:01" (1/1) ... [2025-01-09 15:44:01,614 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-01-09 15:44:01,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:01,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:44:01,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:44:01,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:44:01,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,671 INFO L175 MemorySlicer]: Split 126 memory accesses to 15 slices as follows [2, 7, 6, 18, 20, 8, 3, 8, 9, 6, 6, 7, 15, 8, 3]. 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 17 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:44:01,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:44:01,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:44:01,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:44:01,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:44:01,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (1/1) ... [2025-01-09 15:44:01,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:01,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:01,755 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:44:01,759 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:44:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:44:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:44:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:44:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:44:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-01-09 15:44:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-01-09 15:44:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-01-09 15:44:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:44:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:44:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:44:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:44:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:44:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:44:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 15:44:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:44:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:44:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 15:44:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-01-09 15:44:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:44:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 15:44:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:44:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:44:02,001 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:44:02,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:44:02,483 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-01-09 15:44:02,484 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:44:02,498 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:44:02,500 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:44:02,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:02 BoogieIcfgContainer [2025-01-09 15:44:02,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:44:02,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:44:02,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:44:02,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:44:02,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:01" (1/3) ... [2025-01-09 15:44:02,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:02, skipping insertion in model container [2025-01-09 15:44:02,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:01" (2/3) ... [2025-01-09 15:44:02,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:02, skipping insertion in model container [2025-01-09 15:44:02,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:02" (3/3) ... [2025-01-09 15:44:02,512 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-24.i [2025-01-09 15:44:02,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:44:02,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-24.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:44:02,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:44:02,588 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;@3f9dd61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:44:02,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:44:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:02,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:02,605 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:02,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:02,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1283634891, now seen corresponding path program 1 times [2025-01-09 15:44:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616814263] [2025-01-09 15:44:02,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:02,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:02,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:02,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:44:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:02,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616814263] [2025-01-09 15:44:02,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616814263] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:02,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581770287] [2025-01-09 15:44:02,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:02,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:02,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:02,985 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:44:02,986 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:44:03,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:03,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:03,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:03,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:44:03,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:44:03,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:03,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581770287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:03,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:44:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928372088] [2025-01-09 15:44:03,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:03,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:44:03,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:03,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:44:03,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:44:03,342 INFO L87 Difference]: Start difference. First operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:44:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:03,374 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2025-01-09 15:44:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:44:03,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-01-09 15:44:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:03,383 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:44:03,383 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:44:03,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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:44:03,389 INFO L435 NwaCegarLoop]: 139 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, 139 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:44:03,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:44:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:44:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-01-09 15:44:03,434 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2025-01-09 15:44:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:03,435 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-01-09 15:44:03,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:44:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-01-09 15:44:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:03,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:03,439 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:03,448 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:44:03,639 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:44:03,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:03,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1685957391, now seen corresponding path program 1 times [2025-01-09 15:44:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534353665] [2025-01-09 15:44:03,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:03,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:03,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:03,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:03,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534353665] [2025-01-09 15:44:03,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534353665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:03,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:03,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:44:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289943326] [2025-01-09 15:44:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:44:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:44:03,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:44:03,934 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:03,965 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-01-09 15:44:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:44:03,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 15:44:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:03,968 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:44:03,969 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 15:44:03,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:44:03,970 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:03,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 15:44:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 15:44:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-01-09 15:44:03,985 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2025-01-09 15:44:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-01-09 15:44:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-01-09 15:44:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:03,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:03,988 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:03,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:44:03,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash -119480943, now seen corresponding path program 1 times [2025-01-09 15:44:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032952901] [2025-01-09 15:44:03,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:03,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:04,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:04,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:04,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:04,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032952901] [2025-01-09 15:44:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032952901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:04,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:44:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138864290] [2025-01-09 15:44:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:04,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:44:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:04,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:44:04,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:44:04,144 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:04,175 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-01-09 15:44:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:44:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 15:44:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:04,180 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:44:04,180 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:44:04,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:44:04,181 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:04,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:44:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 15:44:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-01-09 15:44:04,194 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2025-01-09 15:44:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:04,194 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-01-09 15:44:04,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-01-09 15:44:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:04,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:04,197 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:04,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:44:04,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:04,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1140549297, now seen corresponding path program 1 times [2025-01-09 15:44:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:04,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465138185] [2025-01-09 15:44:04,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:04,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:04,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:04,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:04,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465138185] [2025-01-09 15:44:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465138185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:04,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:04,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:44:04,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953777707] [2025-01-09 15:44:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:04,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:44:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:04,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:44:04,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:44:04,418 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:04,456 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2025-01-09 15:44:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:44:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 15:44:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:04,458 INFO L225 Difference]: With dead ends: 198 [2025-01-09 15:44:04,460 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 15:44:04,461 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:44:04,461 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 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:44:04,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 15:44:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-01-09 15:44:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-01-09 15:44:04,469 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2025-01-09 15:44:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:04,470 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-01-09 15:44:04,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-01-09 15:44:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:04,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:04,475 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:04,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:44:04,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash -460490927, now seen corresponding path program 1 times [2025-01-09 15:44:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:04,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307541140] [2025-01-09 15:44:04,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:04,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:04,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:04,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:04,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:04,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307541140] [2025-01-09 15:44:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307541140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:44:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203061463] [2025-01-09 15:44:04,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:04,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:44:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:04,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:44:04,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:44:04,640 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:04,664 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2025-01-09 15:44:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:44:04,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 15:44:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:04,667 INFO L225 Difference]: With dead ends: 202 [2025-01-09 15:44:04,667 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 15:44:04,667 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:44:04,668 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:04,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 15:44:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-01-09 15:44:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-01-09 15:44:04,681 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2025-01-09 15:44:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:04,682 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-01-09 15:44:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-01-09 15:44:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:04,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:04,685 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:04,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:44:04,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:04,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1314516435, now seen corresponding path program 1 times [2025-01-09 15:44:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:04,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059808605] [2025-01-09 15:44:04,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:04,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:04,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:04,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:04,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:04,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:05,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059808605] [2025-01-09 15:44:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059808605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:05,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:05,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623127422] [2025-01-09 15:44:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:05,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:05,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:05,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:05,092 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:05,213 INFO L93 Difference]: Finished difference Result 261 states and 365 transitions. [2025-01-09 15:44:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 15:44:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:05,216 INFO L225 Difference]: With dead ends: 261 [2025-01-09 15:44:05,218 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 15:44:05,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:44:05,219 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 65 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:05,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 591 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 15:44:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-01-09 15:44:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 138 states have (on average 1.3478260869565217) internal successors, (186), 139 states have internal predecessors, (186), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2025-01-09 15:44:05,235 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 124 [2025-01-09 15:44:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:05,235 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2025-01-09 15:44:05,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2025-01-09 15:44:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:44:05,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:05,237 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:05,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:44:05,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:05,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2102279845, now seen corresponding path program 1 times [2025-01-09 15:44:05,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:05,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498416502] [2025-01-09 15:44:05,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:05,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:44:05,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:44:05,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:05,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:05,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498416502] [2025-01-09 15:44:05,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498416502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:05,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:05,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:05,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609734926] [2025-01-09 15:44:05,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:05,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:05,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:05,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:05,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:05,727 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:05,836 INFO L93 Difference]: Finished difference Result 408 states and 571 transitions. [2025-01-09 15:44:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:44:05,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-01-09 15:44:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:05,841 INFO L225 Difference]: With dead ends: 408 [2025-01-09 15:44:05,842 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 15:44:05,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:05,844 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 122 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:05,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 738 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 15:44:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 173. [2025-01-09 15:44:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 154 states have internal predecessors, (208), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2025-01-09 15:44:05,868 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 125 [2025-01-09 15:44:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:05,868 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2025-01-09 15:44:05,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2025-01-09 15:44:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:44:05,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:05,870 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:05,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:44:05,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:05,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1968266339, now seen corresponding path program 1 times [2025-01-09 15:44:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031623183] [2025-01-09 15:44:05,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:05,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:44:05,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:44:05,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:05,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:06,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:06,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031623183] [2025-01-09 15:44:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031623183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:06,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425170541] [2025-01-09 15:44:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:06,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:06,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:06,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:06,201 INFO L87 Difference]: Start difference. First operand 173 states and 242 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:06,331 INFO L93 Difference]: Finished difference Result 423 states and 592 transitions. [2025-01-09 15:44:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:06,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-01-09 15:44:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:06,334 INFO L225 Difference]: With dead ends: 423 [2025-01-09 15:44:06,334 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 15:44:06,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:06,335 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 235 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:06,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 397 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 15:44:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 173. [2025-01-09 15:44:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 154 states have internal predecessors, (207), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 241 transitions. [2025-01-09 15:44:06,358 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 241 transitions. Word has length 125 [2025-01-09 15:44:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 241 transitions. [2025-01-09 15:44:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 241 transitions. [2025-01-09 15:44:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:44:06,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:06,364 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:06,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:44:06,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1100508656, now seen corresponding path program 1 times [2025-01-09 15:44:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345060996] [2025-01-09 15:44:06,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:06,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:44:06,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:44:06,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:06,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:06,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:06,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345060996] [2025-01-09 15:44:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345060996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:06,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122628502] [2025-01-09 15:44:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:06,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:06,735 INFO L87 Difference]: Start difference. First operand 173 states and 241 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:06,810 INFO L93 Difference]: Finished difference Result 421 states and 588 transitions. [2025-01-09 15:44:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-01-09 15:44:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:06,813 INFO L225 Difference]: With dead ends: 421 [2025-01-09 15:44:06,813 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 15:44:06,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:06,814 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 127 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:06,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 519 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 15:44:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 172. [2025-01-09 15:44:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 153 states have internal predecessors, (204), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 238 transitions. [2025-01-09 15:44:06,828 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 238 transitions. Word has length 126 [2025-01-09 15:44:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 238 transitions. [2025-01-09 15:44:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 238 transitions. [2025-01-09 15:44:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:44:06,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:06,830 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:06,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:44:06,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:06,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1200313934, now seen corresponding path program 1 times [2025-01-09 15:44:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:06,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206741669] [2025-01-09 15:44:06,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:06,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:44:06,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:44:06,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:06,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:07,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206741669] [2025-01-09 15:44:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206741669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:07,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:07,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210352239] [2025-01-09 15:44:07,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:07,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:07,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:07,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:07,206 INFO L87 Difference]: Start difference. First operand 172 states and 238 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:07,325 INFO L93 Difference]: Finished difference Result 420 states and 583 transitions. [2025-01-09 15:44:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-01-09 15:44:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:07,327 INFO L225 Difference]: With dead ends: 420 [2025-01-09 15:44:07,327 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 15:44:07,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:07,328 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 217 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:07,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 441 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 15:44:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 173. [2025-01-09 15:44:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 154 states have internal predecessors, (204), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 238 transitions. [2025-01-09 15:44:07,338 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 238 transitions. Word has length 126 [2025-01-09 15:44:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:07,338 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 238 transitions. [2025-01-09 15:44:07,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 238 transitions. [2025-01-09 15:44:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:44:07,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:07,340 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:44:07,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:07,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash 25884258, now seen corresponding path program 1 times [2025-01-09 15:44:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:07,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565971394] [2025-01-09 15:44:07,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:07,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:44:07,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:44:07,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:07,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:08,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565971394] [2025-01-09 15:44:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565971394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:08,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:44:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501556611] [2025-01-09 15:44:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:08,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:44:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:08,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:44:08,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:08,264 INFO L87 Difference]: Start difference. First operand 173 states and 238 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:08,488 INFO L93 Difference]: Finished difference Result 401 states and 549 transitions. [2025-01-09 15:44:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:44:08,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-01-09 15:44:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:08,493 INFO L225 Difference]: With dead ends: 401 [2025-01-09 15:44:08,493 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 15:44:08,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:44:08,494 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 63 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:08,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 828 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 15:44:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 184. [2025-01-09 15:44:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.3353658536585367) internal successors, (219), 165 states have internal predecessors, (219), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 253 transitions. [2025-01-09 15:44:08,510 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 253 transitions. Word has length 127 [2025-01-09 15:44:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:08,511 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 253 transitions. [2025-01-09 15:44:08,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 253 transitions. [2025-01-09 15:44:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:44:08,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:08,512 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:08,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:44:08,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:08,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash 235544578, now seen corresponding path program 1 times [2025-01-09 15:44:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221882827] [2025-01-09 15:44:08,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:08,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:44:08,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:44:08,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:44:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221882827] [2025-01-09 15:44:08,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221882827] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778650615] [2025-01-09 15:44:08,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:08,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:08,741 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:44:08,742 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:44:08,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:44:09,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:44:09,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:09,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:09,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:44:09,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:44:09,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778650615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:09,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:09,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:44:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232479611] [2025-01-09 15:44:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:09,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:09,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:09,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:44:09,089 INFO L87 Difference]: Start difference. First operand 184 states and 253 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:09,126 INFO L93 Difference]: Finished difference Result 371 states and 511 transitions. [2025-01-09 15:44:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:09,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-01-09 15:44:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:09,129 INFO L225 Difference]: With dead ends: 371 [2025-01-09 15:44:09,129 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 15:44:09,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:44:09,130 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 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:44:09,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 15:44:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-01-09 15:44:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 171 states have internal predecessors, (225), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 259 transitions. [2025-01-09 15:44:09,147 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 259 transitions. Word has length 128 [2025-01-09 15:44:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:09,148 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 259 transitions. [2025-01-09 15:44:09,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:44:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 259 transitions. [2025-01-09 15:44:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:44:09,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:09,150 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:09,162 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:44:09,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:09,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:09,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1114536611, now seen corresponding path program 1 times [2025-01-09 15:44:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810136221] [2025-01-09 15:44:09,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:44:09,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:44:09,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:09,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:44:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810136221] [2025-01-09 15:44:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810136221] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044222181] [2025-01-09 15:44:09,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:09,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:09,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:09,979 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:44:09,982 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:44:10,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:44:10,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:44:10,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:10,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:10,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:44:10,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:10,616 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:44:10,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 15:44:10,769 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:44:10,803 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 37 treesize of output 25 [2025-01-09 15:44:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 4 proven. 212 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-01-09 15:44:10,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:11,047 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 36 treesize of output 32 [2025-01-09 15:44:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:44:11,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044222181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:44:11,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:44:11,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 15 [2025-01-09 15:44:11,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147654159] [2025-01-09 15:44:11,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:44:11,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:44:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:11,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:44:11,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:44:11,187 INFO L87 Difference]: Start difference. First operand 190 states and 259 transitions. Second operand has 15 states, 11 states have (on average 6.545454545454546) internal successors, (72), 14 states have internal predecessors, (72), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 6 states have call successors, (32) [2025-01-09 15:44:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:12,093 INFO L93 Difference]: Finished difference Result 552 states and 745 transitions. [2025-01-09 15:44:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 15:44:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 6.545454545454546) internal successors, (72), 14 states have internal predecessors, (72), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 6 states have call successors, (32) Word has length 129 [2025-01-09 15:44:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:12,096 INFO L225 Difference]: With dead ends: 552 [2025-01-09 15:44:12,096 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 15:44:12,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 15:44:12,100 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 457 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:12,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1206 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:44:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 15:44:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 196. [2025-01-09 15:44:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 175 states have (on average 1.3142857142857143) internal successors, (230), 176 states have internal predecessors, (230), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:44:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 264 transitions. [2025-01-09 15:44:12,124 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 264 transitions. Word has length 129 [2025-01-09 15:44:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:12,124 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 264 transitions. [2025-01-09 15:44:12,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 6.545454545454546) internal successors, (72), 14 states have internal predecessors, (72), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 6 states have call successors, (32) [2025-01-09 15:44:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 264 transitions. [2025-01-09 15:44:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:44:12,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:12,127 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:12,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:44:12,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:12,332 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:12,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1091904357, now seen corresponding path program 1 times [2025-01-09 15:44:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:12,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800574919] [2025-01-09 15:44:12,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:12,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:44:12,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:44:12,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:12,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:44:12,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:44:12,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:44:12,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:44:12,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:12,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:44:12,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:44:12,661 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:44:12,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:44:12,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:44:12,666 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:12,867 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:44:12,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:44:12 BoogieIcfgContainer [2025-01-09 15:44:12,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:44:12,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:44:12,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:44:12,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:44:12,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:02" (3/4) ... [2025-01-09 15:44:12,874 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:44:12,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:44:12,875 INFO L158 Benchmark]: Toolchain (without parser) took 11644.27ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 111.2MB in the beginning and 170.8MB in the end (delta: -59.6MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 15:44:12,875 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:44:12,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.62ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:44:12,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.22ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:44:12,876 INFO L158 Benchmark]: Boogie Preprocessor took 94.91ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 89.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:44:12,876 INFO L158 Benchmark]: RCFGBuilder took 791.14ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 51.8MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:44:12,876 INFO L158 Benchmark]: TraceAbstraction took 10367.08ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 51.3MB in the beginning and 170.8MB in the end (delta: -119.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:44:12,877 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 285.2MB. Free memory was 170.8MB in the beginning and 170.8MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:44:12,878 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.53ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.62ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.22ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 94.91ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 89.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 791.14ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 51.8MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10367.08ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 51.3MB in the beginning and 170.8MB in the end (delta: -119.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 285.2MB. Free memory was 170.8MB in the beginning and 170.8MB in the end (delta: 57.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 someBinaryArithmeticDOUBLEoperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L22] signed char var_1_1 = 32; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed char var_1_4 = 16; [L26] signed char var_1_4 = 16; [L27] signed char* var_1_4_Pointer = &(var_1_4); [L28] signed char var_1_5 = 4; [L28] signed char var_1_5 = 4; [L29] signed char* var_1_5_Pointer = &(var_1_5); [L30] signed char var_1_6 = 0; [L30] signed char var_1_6 = 0; [L31] signed char* var_1_6_Pointer = &(var_1_6); [L32] unsigned short int var_1_7 = 0; [L32] unsigned short int var_1_7 = 0; [L33] unsigned short int* var_1_7_Pointer = &(var_1_7); [L34] unsigned short int var_1_10 = 55182; [L34] unsigned short int var_1_10 = 55182; [L35] unsigned short int* var_1_10_Pointer = &(var_1_10); [L36] unsigned char var_1_12 = 0; [L36] unsigned char var_1_12 = 0; [L37] unsigned char* var_1_12_Pointer = &(var_1_12); [L38] unsigned char var_1_14 = 1; [L38] unsigned char var_1_14 = 1; [L39] unsigned char* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 1; [L40] unsigned char var_1_15 = 1; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char var_1_16 = 100; [L42] unsigned char var_1_16 = 100; [L43] unsigned char* var_1_16_Pointer = &(var_1_16); [L44] float var_1_17 = 2.25; [L44] float var_1_17 = 2.25; [L45] float* var_1_17_Pointer = &(var_1_17); [L46] float var_1_18 = 199.4; [L46] float var_1_18 = 199.4; [L47] float* var_1_18_Pointer = &(var_1_18); [L48] signed char var_1_19 = -128; [L48] signed char var_1_19 = -128; [L49] signed char* var_1_19_Pointer = &(var_1_19); VAL [isInitial=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L106] isInitial = 1 [L107] FCALL initially() [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_uchar() [L76] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L77] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L77] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L77] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L78] var_1_4 = __VERIFIER_nondet_char() [L79] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L80] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L80] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L80] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L81] var_1_5 = __VERIFIER_nondet_char() [L82] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L83] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L83] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L83] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L84] var_1_6 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L86] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L87] var_1_10 = __VERIFIER_nondet_ushort() [L88] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L89] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L90] var_1_14 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L91] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L91] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L92] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L92] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L93] var_1_15 = __VERIFIER_nondet_uchar() [L94] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L94] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L94] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L95] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L95] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L95] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L96] var_1_18 = __VERIFIER_nondet_float() [L97] EXPR \read(var_1_18) [L97] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F [L97] EXPR \read(var_1_18) [L97] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L110] RET updateVariables() [L111] CALL step() [L53] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L53] COND FALSE !(! (*(var_1_2_Pointer))) [L56] EXPR \read(*var_1_15_Pointer) [L56] (*(var_1_12_Pointer)) = ((! (*(var_1_15_Pointer))) || (! (! 0))) [L58] EXPR \read(*var_1_5_Pointer) [L58] (*(var_1_16_Pointer)) = (*(var_1_5_Pointer)) [L59] EXPR \read(*var_1_18_Pointer) [L59] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L60] EXPR \read(*var_1_4_Pointer) [L60] (*(var_1_19_Pointer)) = (*(var_1_4_Pointer)) [L61] EXPR \read(*var_1_12_Pointer) [L61] (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L61] (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) [L61] EXPR \read(*var_1_17_Pointer) [L61] (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L61] COND TRUE (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) [L62] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L62] COND FALSE !((*(var_1_12_Pointer))) [L65] EXPR \read(*var_1_4_Pointer) [L65] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] EXPR (((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L65] EXPR \read(*var_1_5_Pointer) [L65] EXPR (((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] EXPR (((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer))) [L65] EXPR \read(*var_1_6_Pointer) [L65] EXPR (((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] (*(var_1_1_Pointer)) = (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer))))) [L70] EXPR \read(*var_1_17_Pointer) [L70] EXPR \read(*var_1_17_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L70] EXPR ((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)) [L70] EXPR \read(*var_1_17_Pointer) [L70] EXPR ((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L70] EXPR \read(*var_1_17_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L70] COND FALSE !(((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR \read(*var_1_12_Pointer) [L102] EXPR (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) [L102] EXPR \read(*var_1_17_Pointer) [L102] EXPR (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_4_Pointer) [L102] EXPR ((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0)))))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0)))))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102-L103] return (((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1288 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1288 mSDsluCounter, 6721 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4658 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 2063 mSDtfsCounter, 886 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 526 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=13, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 538 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2140 NumberOfCodeBlocks, 2140 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2123 ConstructedInterpolants, 0 QuantifiedInterpolants, 4523 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1721 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 6834/7140 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:44:12,899 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-24.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 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:44:15,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:44:15,344 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:44:15,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:44:15,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:44:15,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:44:15,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:44:15,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:44:15,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:44:15,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:44:15,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:44:15,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:44:15,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:44:15,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:44:15,386 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:44:15,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:44:15,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:44:15,387 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:44:15,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:44:15,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:44:15,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:15,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:15,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:44:15,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:44:15,389 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 -> 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 [2025-01-09 15:44:15,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:44:15,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:44:15,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:44:15,705 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:44:15,706 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:44:15,707 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-24.i [2025-01-09 15:44:17,075 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2a703113/bc153098157946fea8810c74a364ee59/FLAGb33253414 [2025-01-09 15:44:17,331 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:44:17,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i [2025-01-09 15:44:17,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2a703113/bc153098157946fea8810c74a364ee59/FLAGb33253414 [2025-01-09 15:44:17,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2a703113/bc153098157946fea8810c74a364ee59 [2025-01-09 15:44:17,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:44:17,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:44:17,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:17,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:44:17,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:44:17,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754b19e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17, skipping insertion in model container [2025-01-09 15:44:17,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:44:17,522 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-24.i[916,929] [2025-01-09 15:44:17,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:17,608 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:44:17,616 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-24.i[916,929] [2025-01-09 15:44:17,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:17,673 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:44:17,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17 WrapperNode [2025-01-09 15:44:17,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:17,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:17,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:44:17,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:44:17,684 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:44:17" (1/1) ... [2025-01-09 15:44:17,701 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:44:17" (1/1) ... [2025-01-09 15:44:17,742 INFO L138 Inliner]: procedures = 33, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2025-01-09 15:44:17,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:17,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:44:17,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:44:17,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:44:17,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,805 INFO L175 MemorySlicer]: Split 126 memory accesses to 15 slices as follows [2, 7, 6, 18, 20, 8, 3, 8, 9, 6, 6, 7, 15, 8, 3]. 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 17 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:44:17,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:44:17,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:44:17,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:44:17,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:44:17,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (1/1) ... [2025-01-09 15:44:17,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:17,893 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:44:17,900 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:44:17,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:44:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:44:17,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:44:17,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:44:17,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-09 15:44:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-01-09 15:44:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-01-09 15:44:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-01-09 15:44:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:44:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:44:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:44:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:44:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:44:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:44:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:44:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-01-09 15:44:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-01-09 15:44:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-01-09 15:44:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-01-09 15:44:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:44:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:44:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:44:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:44:17,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:44:17,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:44:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:44:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-01-09 15:44:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-01-09 15:44:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-01-09 15:44:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-01-09 15:44:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:44:17,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:44:17,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:44:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-01-09 15:44:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-01-09 15:44:18,175 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:44:18,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:44:36,848 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-01-09 15:44:36,848 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:44:36,861 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:44:36,861 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:44:36,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:36 BoogieIcfgContainer [2025-01-09 15:44:36,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:44:36,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:44:36,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:44:36,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:44:36,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:17" (1/3) ... [2025-01-09 15:44:36,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b70749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:36, skipping insertion in model container [2025-01-09 15:44:36,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:17" (2/3) ... [2025-01-09 15:44:36,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b70749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:36, skipping insertion in model container [2025-01-09 15:44:36,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:36" (3/3) ... [2025-01-09 15:44:36,871 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-24.i [2025-01-09 15:44:36,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:44:36,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-24.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:44:36,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:44:36,952 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;@7927465d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:44:36,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:44:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:36,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:36,969 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:36,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:36,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1283634891, now seen corresponding path program 1 times [2025-01-09 15:44:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512568465] [2025-01-09 15:44:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:36,989 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:44:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:36,994 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:44:36,996 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:44:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:38,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:38,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:38,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:38,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:44:38,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 15:44:38,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:38,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:38,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512568465] [2025-01-09 15:44:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512568465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:38,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:38,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:44:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080488155] [2025-01-09 15:44:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:44:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:38,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:44:38,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:44:38,252 INFO L87 Difference]: Start difference. First operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:44:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:38,272 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2025-01-09 15:44:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:44:38,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-01-09 15:44:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:38,278 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:44:38,278 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:44:38,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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:44:38,283 INFO L435 NwaCegarLoop]: 139 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, 139 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:44:38,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:44:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:44:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:44:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-01-09 15:44:38,324 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2025-01-09 15:44:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-01-09 15:44:38,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:44:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-01-09 15:44:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:44:38,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:38,332 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:44:38,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:44:38,533 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:44:38,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:38,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1685957391, now seen corresponding path program 1 times [2025-01-09 15:44:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:38,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873902506] [2025-01-09 15:44:38,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:38,535 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:44:38,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:38,537 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:44:38,538 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:44:38,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:44:39,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:44:39,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:39,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:39,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:44:39,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:51,279 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 36 treesize of output 24 [2025-01-09 15:44:51,321 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 13 treesize of output 9 [2025-01-09 15:44:51,921 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 33 treesize of output 21 [2025-01-09 15:44:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 185 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-09 15:44:52,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:58,827 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:44:58,828 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 30 treesize of output 25 [2025-01-09 15:45:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 15:45:01,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:45:01,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873902506] [2025-01-09 15:45:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873902506] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:45:01,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:45:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2025-01-09 15:45:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211972693] [2025-01-09 15:45:01,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:45:01,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 15:45:01,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:45:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 15:45:01,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:45:01,784 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 22 states, 18 states have (on average 4.555555555555555) internal successors, (82), 20 states have internal predecessors, (82), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 7 states have call successors, (30)