./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f802e4b29f0418f88d57c54c85d895eef5b6d61ec1a9d95da4d23427a66c87d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:33:11,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:33:11,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:33:11,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:33:11,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:33:11,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:33:11,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:33:11,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:33:11,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:33:11,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:33:11,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:33:11,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:33:11,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:33:11,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:33:11,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:33:11,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:33:11,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:11,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:33:11,752 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f802e4b29f0418f88d57c54c85d895eef5b6d61ec1a9d95da4d23427a66c87d [2025-03-04 01:33:12,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:33:12,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:33:12,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:33:12,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:33:12,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:33:12,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i [2025-03-04 01:33:13,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29221b70a/18c7c80b1c83481395fc74fde41cc91f/FLAG9a095055b [2025-03-04 01:33:13,487 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:33:13,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i [2025-03-04 01:33:13,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29221b70a/18c7c80b1c83481395fc74fde41cc91f/FLAG9a095055b [2025-03-04 01:33:13,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29221b70a/18c7c80b1c83481395fc74fde41cc91f [2025-03-04 01:33:13,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:33:13,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:33:13,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:13,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:33:13,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:33:13,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13, skipping insertion in model container [2025-03-04 01:33:13,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:33:13,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i[916,929] [2025-03-04 01:33:13,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:13,724 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:33:13,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i[916,929] [2025-03-04 01:33:13,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:13,796 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:33:13,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13 WrapperNode [2025-03-04 01:33:13,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:13,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:13,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:33:13,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:33:13,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,860 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2025-03-04 01:33:13,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:13,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:33:13,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:33:13,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:33:13,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,895 INFO L175 MemorySlicer]: Split 133 memory accesses to 15 slices as follows [2, 9, 10, 16, 16, 8, 16, 6, 18, 8, 8, 6, 3, 4, 3]. 14 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, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1]. [2025-03-04 01:33:13,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:33:13,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:33:13,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:33:13,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:33:13,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (1/1) ... [2025-03-04 01:33:13,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:13,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:13,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:33:13,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:33:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:33:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:33:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-04 01:33:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-04 01:33:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-04 01:33:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:33:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:33:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:33:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:33:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:33:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:33:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:33:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:33:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:33:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:33:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:33:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:33:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:33:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:33:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:33:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:33:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:33:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:33:13,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:33:14,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:33:14,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:33:14,669 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem82#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise91#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~short104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite130#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~ite127#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1; [2025-03-04 01:33:14,715 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-04 01:33:14,715 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:33:14,732 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:33:14,733 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:33:14,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:14 BoogieIcfgContainer [2025-03-04 01:33:14,734 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:33:14,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:33:14,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:33:14,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:33:14,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:33:13" (1/3) ... [2025-03-04 01:33:14,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:14, skipping insertion in model container [2025-03-04 01:33:14,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:13" (2/3) ... [2025-03-04 01:33:14,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:14, skipping insertion in model container [2025-03-04 01:33:14,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:14" (3/3) ... [2025-03-04 01:33:14,741 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-82.i [2025-03-04 01:33:14,752 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:33:14,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-82.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:33:14,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:33:14,805 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;@5d86b321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:33:14,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:33:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:33:14,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:14,818 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:14,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash -192753194, now seen corresponding path program 1 times [2025-03-04 01:33:14,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:14,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105841870] [2025-03-04 01:33:14,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:14,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:14,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:33:15,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105841870] [2025-03-04 01:33:15,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105841870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:15,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407711515] [2025-03-04 01:33:15,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:15,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:15,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:15,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:33:15,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:15,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:15,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:15,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:15,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:33:15,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:33:15,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407711515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:15,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:15,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:33:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147599170] [2025-03-04 01:33:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:33:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:15,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:33:15,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:15,479 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:15,510 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-03-04 01:33:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:33:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-03-04 01:33:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:15,519 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:33:15,519 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:33:15,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:15,523 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:15,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:33:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 01:33:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2025-03-04 01:33:15,560 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 121 [2025-03-04 01:33:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:15,560 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2025-03-04 01:33:15,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2025-03-04 01:33:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:33:15,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:15,566 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:15,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:15,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:33:15,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:15,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1984213193, now seen corresponding path program 1 times [2025-03-04 01:33:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:15,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795525273] [2025-03-04 01:33:15,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:15,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:15,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:15,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:15,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795525273] [2025-03-04 01:33:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795525273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725323861] [2025-03-04 01:33:16,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:16,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:16,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:16,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:33:16,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:16,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:16,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:16,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:16,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:33:16,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:16,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725323861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:16,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:33:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129386930] [2025-03-04 01:33:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:16,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:16,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:16,474 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:16,511 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2025-03-04 01:33:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:33:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:16,514 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:33:16,515 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:33:16,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:16,516 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:16,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:33:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-04 01:33:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-03-04 01:33:16,527 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 121 [2025-03-04 01:33:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:16,532 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-03-04 01:33:16,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-03-04 01:33:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:33:16,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:16,533 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:16,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:33:16,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:33:16,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:16,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash 176758730, now seen corresponding path program 1 times [2025-03-04 01:33:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:16,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483328897] [2025-03-04 01:33:16,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:16,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:16,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:16,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:16,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:16,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:16,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483328897] [2025-03-04 01:33:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483328897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826809102] [2025-03-04 01:33:16,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:16,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:16,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:16,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:16,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:33:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:17,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:17,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:17,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:17,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:33:17,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:17,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:17,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826809102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:17,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:17,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:33:17,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517864114] [2025-03-04 01:33:17,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:17,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:17,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:17,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:17,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:17,172 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:17,201 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2025-03-04 01:33:17,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:17,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:33:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:17,203 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:33:17,203 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:33:17,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:17,204 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:17,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 446 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:33:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-04 01:33:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-03-04 01:33:17,217 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 121 [2025-03-04 01:33:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-03-04 01:33:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-03-04 01:33:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:33:17,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:17,218 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:17,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:17,421 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1064262411, now seen corresponding path program 1 times [2025-03-04 01:33:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801101139] [2025-03-04 01:33:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:17,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:17,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:17,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:17,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:17,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:17,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801101139] [2025-03-04 01:33:17,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801101139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:17,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764856435] [2025-03-04 01:33:17,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:17,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:17,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:17,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:17,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:33:17,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:17,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:17,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:17,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:17,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:33:17,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:17,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764856435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:33:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957928286] [2025-03-04 01:33:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:17,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:17,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:17,808 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:17,829 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2025-03-04 01:33:17,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:17,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:33:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:17,831 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:33:17,831 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:33:17,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:17,833 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:17,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:33:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:33:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2025-03-04 01:33:17,843 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 121 [2025-03-04 01:33:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:17,844 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2025-03-04 01:33:17,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2025-03-04 01:33:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:33:17,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:17,848 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:17,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:33:18,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:18,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:18,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1065185932, now seen corresponding path program 1 times [2025-03-04 01:33:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:18,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473517079] [2025-03-04 01:33:18,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:18,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:18,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:18,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:18,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473517079] [2025-03-04 01:33:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473517079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475116956] [2025-03-04 01:33:18,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:18,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:18,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:18,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:18,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:33:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:18,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:18,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:18,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:18,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:33:18,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:18,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475116956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:18,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:18,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:33:18,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219828556] [2025-03-04 01:33:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:18,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:18,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:18,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:18,475 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:18,501 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2025-03-04 01:33:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:33:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:18,504 INFO L225 Difference]: With dead ends: 233 [2025-03-04 01:33:18,504 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:33:18,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:18,506 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:18,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:33:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 01:33:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-03-04 01:33:18,519 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 121 [2025-03-04 01:33:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:18,519 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-03-04 01:33:18,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-03-04 01:33:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:18,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:18,521 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:18,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 01:33:18,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:18,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:18,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash 556476518, now seen corresponding path program 1 times [2025-03-04 01:33:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:18,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643695122] [2025-03-04 01:33:18,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:18,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:18,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:18,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:18,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643695122] [2025-03-04 01:33:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643695122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519955490] [2025-03-04 01:33:18,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:18,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:18,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:18,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:33:19,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:19,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:19,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:33:19,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:19,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:19,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519955490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:19,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:19,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:33:19,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248148356] [2025-03-04 01:33:19,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:19,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:19,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:19,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:19,112 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:19,145 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2025-03-04 01:33:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:19,147 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:33:19,147 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:33:19,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:19,148 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:19,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:33:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-04 01:33:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2025-03-04 01:33:19,156 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 123 [2025-03-04 01:33:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:19,156 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2025-03-04 01:33:19,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2025-03-04 01:33:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:19,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:19,159 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:19,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:19,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:19,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:19,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -177795032, now seen corresponding path program 1 times [2025-03-04 01:33:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955995103] [2025-03-04 01:33:19,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:19,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:19,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:19,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:19,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955995103] [2025-03-04 01:33:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955995103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315356842] [2025-03-04 01:33:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:19,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:19,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:19,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:19,633 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:19,690 INFO L93 Difference]: Finished difference Result 290 states and 400 transitions. [2025-03-04 01:33:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-04 01:33:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:19,692 INFO L225 Difference]: With dead ends: 290 [2025-03-04 01:33:19,693 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:33:19,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:19,694 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 63 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:19,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 675 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:33:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 130. [2025-03-04 01:33:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 114 states have internal predecessors, (153), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2025-03-04 01:33:19,704 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 125 [2025-03-04 01:33:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:19,704 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2025-03-04 01:33:19,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2025-03-04 01:33:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:33:19,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:19,705 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:19,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:33:19,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:19,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1606096595, now seen corresponding path program 1 times [2025-03-04 01:33:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:19,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273941294] [2025-03-04 01:33:19,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:19,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:33:19,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:33:19,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:19,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:19,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273941294] [2025-03-04 01:33:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273941294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:19,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578818888] [2025-03-04 01:33:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:19,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:19,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:19,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:19,886 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:19,934 INFO L93 Difference]: Finished difference Result 295 states and 407 transitions. [2025-03-04 01:33:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-03-04 01:33:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:19,936 INFO L225 Difference]: With dead ends: 295 [2025-03-04 01:33:19,936 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 01:33:19,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:19,937 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 67 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:19,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 735 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 01:33:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 125. [2025-03-04 01:33:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2025-03-04 01:33:19,944 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 126 [2025-03-04 01:33:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2025-03-04 01:33:19,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2025-03-04 01:33:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:33:19,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:19,946 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:33:19,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -351603880, now seen corresponding path program 1 times [2025-03-04 01:33:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:19,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528650248] [2025-03-04 01:33:19,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:33:19,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:33:19,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:19,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528650248] [2025-03-04 01:33:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528650248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:20,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:20,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840033197] [2025-03-04 01:33:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:20,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:20,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:20,087 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:20,167 INFO L93 Difference]: Finished difference Result 321 states and 445 transitions. [2025-03-04 01:33:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-03-04 01:33:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:20,168 INFO L225 Difference]: With dead ends: 321 [2025-03-04 01:33:20,169 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 01:33:20,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:20,169 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 70 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:20,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 689 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 01:33:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2025-03-04 01:33:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 149 states have internal predecessors, (203), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 231 transitions. [2025-03-04 01:33:20,175 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 231 transitions. Word has length 126 [2025-03-04 01:33:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:20,175 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 231 transitions. [2025-03-04 01:33:20,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 231 transitions. [2025-03-04 01:33:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:33:20,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:20,176 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:20,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:33:20,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:20,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1614232148, now seen corresponding path program 1 times [2025-03-04 01:33:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683046163] [2025-03-04 01:33:20,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:20,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:33:20,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:33:20,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:20,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683046163] [2025-03-04 01:33:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683046163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:33:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965229866] [2025-03-04 01:33:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:33:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:21,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:33:21,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:33:21,261 INFO L87 Difference]: Start difference. First operand 165 states and 231 transitions. Second operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 01:33:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:21,936 INFO L93 Difference]: Finished difference Result 458 states and 644 transitions. [2025-03-04 01:33:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:33:21,937 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 126 [2025-03-04 01:33:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:21,938 INFO L225 Difference]: With dead ends: 458 [2025-03-04 01:33:21,938 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 01:33:21,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:33:21,939 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 442 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:21,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1775 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:33:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 01:33:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 293. [2025-03-04 01:33:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 270 states have (on average 1.3814814814814815) internal successors, (373), 271 states have internal predecessors, (373), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:33:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 413 transitions. [2025-03-04 01:33:21,951 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 413 transitions. Word has length 126 [2025-03-04 01:33:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:21,951 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 413 transitions. [2025-03-04 01:33:21,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 01:33:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 413 transitions. [2025-03-04 01:33:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:33:21,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:21,953 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:21,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:33:21,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:21,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash 991774300, now seen corresponding path program 1 times [2025-03-04 01:33:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:21,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112099840] [2025-03-04 01:33:21,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:21,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:21,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:33:21,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:33:21,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:21,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112099840] [2025-03-04 01:33:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112099840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:22,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207254504] [2025-03-04 01:33:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:22,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:22,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:22,122 INFO L87 Difference]: Start difference. First operand 293 states and 413 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:22,249 INFO L93 Difference]: Finished difference Result 745 states and 1051 transitions. [2025-03-04 01:33:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-03-04 01:33:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:22,253 INFO L225 Difference]: With dead ends: 745 [2025-03-04 01:33:22,253 INFO L226 Difference]: Without dead ends: 455 [2025-03-04 01:33:22,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:22,256 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 139 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:22,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 644 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-04 01:33:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 345. [2025-03-04 01:33:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 307 states have (on average 1.3615635179153094) internal successors, (418), 308 states have internal predecessors, (418), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:33:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 486 transitions. [2025-03-04 01:33:22,282 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 486 transitions. Word has length 126 [2025-03-04 01:33:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:22,282 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 486 transitions. [2025-03-04 01:33:22,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 486 transitions. [2025-03-04 01:33:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:22,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:22,283 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:22,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:33:22,283 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:22,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash -880646323, now seen corresponding path program 1 times [2025-03-04 01:33:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899156751] [2025-03-04 01:33:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:22,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:22,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:22,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:22,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:22,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899156751] [2025-03-04 01:33:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899156751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:22,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:22,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:33:22,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012296032] [2025-03-04 01:33:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:22,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:33:22,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:22,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:33:22,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:33:22,382 INFO L87 Difference]: Start difference. First operand 345 states and 486 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:22,414 INFO L93 Difference]: Finished difference Result 769 states and 1079 transitions. [2025-03-04 01:33:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:33:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-04 01:33:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:22,417 INFO L225 Difference]: With dead ends: 769 [2025-03-04 01:33:22,417 INFO L226 Difference]: Without dead ends: 479 [2025-03-04 01:33:22,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:33:22,418 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 68 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:22,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 358 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-04 01:33:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 411. [2025-03-04 01:33:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 373 states have (on average 1.3672922252010724) internal successors, (510), 374 states have internal predecessors, (510), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:33:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 578 transitions. [2025-03-04 01:33:22,441 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 578 transitions. Word has length 127 [2025-03-04 01:33:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:22,442 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 578 transitions. [2025-03-04 01:33:22,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 578 transitions. [2025-03-04 01:33:22,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:33:22,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:22,443 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:22,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:33:22,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:22,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1976603198, now seen corresponding path program 1 times [2025-03-04 01:33:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:22,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416353509] [2025-03-04 01:33:22,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:22,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:22,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:33:22,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:33:22,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:22,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:33:22,556 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:33:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:33:22,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:33:22,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:22,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:33:22,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:33:22,703 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:33:22,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:33:22,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:33:22,707 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:22,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:33:22,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:33:22 BoogieIcfgContainer [2025-03-04 01:33:22,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:33:22,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:33:22,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:33:22,872 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:33:22,873 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:14" (3/4) ... [2025-03-04 01:33:22,874 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:33:22,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:33:22,877 INFO L158 Benchmark]: Toolchain (without parser) took 9365.26ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 123.3MB in the beginning and 181.1MB in the end (delta: -57.8MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. [2025-03-04 01:33:22,877 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:33:22,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.09ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:33:22,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.94ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 104.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:33:22,878 INFO L158 Benchmark]: Boogie Preprocessor took 63.22ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 98.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:33:22,878 INFO L158 Benchmark]: IcfgBuilder took 808.97ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 54.7MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:33:22,878 INFO L158 Benchmark]: TraceAbstraction took 8136.03ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 54.0MB in the beginning and 181.2MB in the end (delta: -127.2MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2025-03-04 01:33:22,878 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 369.1MB. Free memory was 181.2MB in the beginning and 181.1MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:33:22,880 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.09ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 108.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.94ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 104.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.22ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 98.6MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 808.97ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 54.7MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8136.03ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 54.0MB in the beginning and 181.2MB in the end (delta: -127.2MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 369.1MB. Free memory was 181.2MB in the beginning and 181.1MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 128.75; [L22] float var_1_1 = 128.75; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 1; [L24] unsigned char var_1_2 = 1; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 63.5; [L26] float var_1_3 = 63.5; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] float var_1_4 = 255.5; [L28] float var_1_4 = 255.5; [L29] float* var_1_4_Pointer = &(var_1_4); [L30] unsigned char var_1_5 = 32; [L30] unsigned char var_1_5 = 32; [L31] unsigned char* var_1_5_Pointer = &(var_1_5); [L32] unsigned char var_1_9 = 25; [L32] unsigned char var_1_9 = 25; [L33] unsigned char* var_1_9_Pointer = &(var_1_9); [L34] unsigned char var_1_10 = 128; [L34] unsigned char var_1_10 = 128; [L35] unsigned char* var_1_10_Pointer = &(var_1_10); [L36] unsigned char var_1_11 = 16; [L36] unsigned char var_1_11 = 16; [L37] unsigned char* var_1_11_Pointer = &(var_1_11); [L38] unsigned char var_1_12 = 2; [L38] unsigned char var_1_12 = 2; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_14 = 5; [L40] unsigned char var_1_14 = 5; [L41] unsigned char* var_1_14_Pointer = &(var_1_14); [L42] unsigned char var_1_15 = 10; [L42] unsigned char var_1_15 = 10; [L43] unsigned char* var_1_15_Pointer = &(var_1_15); [L44] double var_1_16 = 3.75; [L44] double var_1_16 = 3.75; [L45] double* var_1_16_Pointer = &(var_1_16); [L46] unsigned char var_1_17 = 0; [L46] unsigned char var_1_17 = 0; [L47] unsigned char* var_1_17_Pointer = &(var_1_17); [L48] double var_1_18 = 255.5; [L48] double var_1_18 = 255.5; [L49] double* var_1_18_Pointer = &(var_1_18); [L50] unsigned char last_1_var_1_5 = 32; [L51] unsigned char last_1_var_1_12 = 2; [L52] unsigned char last_1_var_1_17 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L108] EXPR \read(var_1_5) [L108] last_1_var_1_5 = var_1_5 [L109] EXPR \read(var_1_12) [L109] last_1_var_1_12 = var_1_12 [L110] EXPR \read(var_1_17) [L110] last_1_var_1_17 = var_1_17 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] var_1_3 = __VERIFIER_nondet_float() [L88] EXPR \read(var_1_3) [L88] EXPR var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F [L88] EXPR \read(var_1_3) [L88] EXPR var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR (var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR (var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] var_1_4 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_4) [L90] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F [L90] EXPR \read(var_1_4) [L90] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] var_1_10 = __VERIFIER_nondet_uchar() [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_11 = __VERIFIER_nondet_uchar() [L98] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] var_1_15 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L121] RET updateVariables() [L122] CALL step() [L56] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L56] signed long int stepLocal_0 = last_1_var_1_17 | last_1_var_1_12; [L57] COND FALSE !((last_1_var_1_5 / -2) >= stepLocal_0) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] EXPR (((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))) [L60] EXPR \read(*var_1_11_Pointer) [L60] EXPR (((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] (*(var_1_5_Pointer)) = ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) [L62] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L62] COND FALSE !(! (*(var_1_2_Pointer))) [L67] EXPR \read(*var_1_4_Pointer) [L67] (*(var_1_16_Pointer)) = (*(var_1_4_Pointer)) [L68] EXPR \read(*var_1_9_Pointer) [L68] (*(var_1_17_Pointer)) = (*(var_1_9_Pointer)) [L69] EXPR \read(*var_1_3_Pointer) [L69] (*(var_1_18_Pointer)) = (*(var_1_3_Pointer)) [L70] EXPR \read(*var_1_9_Pointer) [L70] unsigned char stepLocal_1 = (*(var_1_9_Pointer)); [L71] EXPR \read(*var_1_5_Pointer) [L71] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] COND FALSE !(((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= stepLocal_1) [L80] EXPR \read(*var_1_9_Pointer) [L80] (*(var_1_12_Pointer)) = (*(var_1_9_Pointer)) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1 [L113] EXPR (! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))) [L113] EXPR \read(*var_1_5_Pointer) [L113] EXPR \read(*var_1_10_Pointer) [L113] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))) [L113] EXPR \read(*var_1_11_Pointer) [L113] EXPR (((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) [L113] EXPR \read(*var_1_5_Pointer) [L113] EXPR \read(*var_1_11_Pointer) [L113] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) [L113] EXPR \read(*var_1_12_Pointer) [L113] EXPR \read(*var_1_9_Pointer) [L113] EXPR (((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer)))) [L113] EXPR \read(*var_1_16_Pointer) [L113] EXPR \read(*var_1_4_Pointer) [L113] EXPR ((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR (((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) [L113] EXPR \read(*var_1_17_Pointer) [L113] EXPR \read(*var_1_9_Pointer) [L113] EXPR (((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((*(var_1_18_Pointer)) == ((double) (*(var_1_3_Pointer)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] EXPR ((((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((*(var_1_18_Pointer)) == ((double) (*(var_1_3_Pointer)))) [L113] EXPR \read(*var_1_18_Pointer) [L113] EXPR \read(*var_1_3_Pointer) [L113] EXPR ((((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((*(var_1_18_Pointer)) == ((double) (*(var_1_3_Pointer)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113-L114] return ((((((! (*(var_1_2_Pointer))) ? ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_3_Pointer))) > ((*(var_1_4_Pointer)))) ? ((*(var_1_3_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_5_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) - (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))))))) && ((((*(var_1_5_Pointer)) + (*(var_1_11_Pointer))) >= (*(var_1_9_Pointer))) ? (((((((*(var_1_4_Pointer))) > (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_1_Pointer)) * (*(var_1_3_Pointer)))))) <= (*(var_1_1_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))))) : ((*(var_1_2_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) + (*(var_1_15_Pointer))))) : 1)) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))))) && ((*(var_1_16_Pointer)) == ((double) (*(var_1_4_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((*(var_1_18_Pointer)) == ((double) (*(var_1_3_Pointer)))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_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_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 852 mSDsluCounter, 7411 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5424 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 1987 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=12, InterpolantAutomatonStates: 62, 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, 12 MinimizatonAttempts, 306 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2194 ConstructedInterpolants, 0 QuantifiedInterpolants, 3467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3379 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 6331/6552 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:33:22,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f802e4b29f0418f88d57c54c85d895eef5b6d61ec1a9d95da4d23427a66c87d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:33:24,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:33:24,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:33:24,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:33:24,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:33:24,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:33:24,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:33:24,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:33:24,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:33:24,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:33:24,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:33:24,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:33:24,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:33:24,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:33:24,854 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:33:24,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:33:24,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:33:24,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:33:24,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:33:24,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:33:24,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:33:24,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:33:24,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:33:24,856 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:33:24,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:33:24,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:33:24,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:33:24,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:33:24,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:33:24,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:33:24,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:24,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:33:24,857 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:33:24,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:33:24,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:33:24,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:33:24,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:33:24,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:33:24,858 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f802e4b29f0418f88d57c54c85d895eef5b6d61ec1a9d95da4d23427a66c87d [2025-03-04 01:33:25,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:33:25,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:33:25,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:33:25,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:33:25,082 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:33:25,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i [2025-03-04 01:33:26,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1b42219/4c53018669c141f7a820ea7af43a6730/FLAG40d3756b7 [2025-03-04 01:33:26,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:33:26,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i [2025-03-04 01:33:26,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1b42219/4c53018669c141f7a820ea7af43a6730/FLAG40d3756b7 [2025-03-04 01:33:26,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1b42219/4c53018669c141f7a820ea7af43a6730 [2025-03-04 01:33:26,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:33:26,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:33:26,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:26,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:33:26,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:33:26,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c350a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26, skipping insertion in model container [2025-03-04 01:33:26,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:33:26,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i[916,929] [2025-03-04 01:33:26,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:26,688 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:33:26,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-82.i[916,929] [2025-03-04 01:33:26,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:26,738 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:33:26,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26 WrapperNode [2025-03-04 01:33:26,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:26,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:26,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:33:26,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:33:26,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,795 INFO L138 Inliner]: procedures = 33, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2025-03-04 01:33:26,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:26,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:33:26,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:33:26,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:33:26,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,851 INFO L175 MemorySlicer]: Split 133 memory accesses to 15 slices as follows [2, 9, 10, 16, 16, 8, 16, 6, 18, 8, 8, 6, 3, 4, 3]. 14 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, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1]. [2025-03-04 01:33:26,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:33:26,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:33:26,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:33:26,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:33:26,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:26,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:33:26,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-04 01:33:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:33:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:33:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:33:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-04 01:33:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-04 01:33:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-04 01:33:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-04 01:33:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-04 01:33:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-04 01:33:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-04 01:33:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-04 01:33:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:33:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:33:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:33:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:33:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:33:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:33:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:33:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-04 01:33:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-04 01:33:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-04 01:33:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-04 01:33:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-03-04 01:33:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-03-04 01:33:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2025-03-04 01:33:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2025-03-04 01:33:26,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:33:26,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:33:26,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:33:26,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:33:26,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:33:26,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-04 01:33:26,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-04 01:33:27,140 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:33:27,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:33:29,300 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~mem80#1;havoc property_#t~ite89#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite101#1;havoc property_#t~mem94#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite128#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~ite125#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short132#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1; [2025-03-04 01:33:29,337 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-04 01:33:29,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:33:29,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:33:29,346 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:33:29,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:29 BoogieIcfgContainer [2025-03-04 01:33:29,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:33:29,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:33:29,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:33:29,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:33:29,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:33:26" (1/3) ... [2025-03-04 01:33:29,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac16a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:29, skipping insertion in model container [2025-03-04 01:33:29,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (2/3) ... [2025-03-04 01:33:29,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac16a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:29, skipping insertion in model container [2025-03-04 01:33:29,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:29" (3/3) ... [2025-03-04 01:33:29,356 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-82.i [2025-03-04 01:33:29,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:33:29,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-82.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:33:29,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:33:29,416 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;@1ddd0bd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:33:29,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:33:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:33:29,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:29,426 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:29,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:29,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1738834489, now seen corresponding path program 1 times [2025-03-04 01:33:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:29,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648668020] [2025-03-04 01:33:29,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:29,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:29,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:29,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:29,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:33:29,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:33:29,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:33:29,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:29,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:29,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:33:29,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-04 01:33:29,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:29,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648668020] [2025-03-04 01:33:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648668020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:33:29,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215928350] [2025-03-04 01:33:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:29,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:33:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:29,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:33:29,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:29,818 INFO L87 Difference]: Start difference. First operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:29,845 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2025-03-04 01:33:29,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:33:29,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-04 01:33:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:29,851 INFO L225 Difference]: With dead ends: 208 [2025-03-04 01:33:29,852 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 01:33:29,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:29,858 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:29,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 01:33:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 01:33:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-03-04 01:33:29,896 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 119 [2025-03-04 01:33:29,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:29,897 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-03-04 01:33:29,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-03-04 01:33:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:33:29,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:29,900 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:29,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:33:30,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:30,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:30,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1304584634, now seen corresponding path program 1 times [2025-03-04 01:33:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:30,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511602393] [2025-03-04 01:33:30,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:30,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:30,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:30,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:33:30,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:33:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:33:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:30,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:33:30,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:30,410 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 17 treesize of output 9 [2025-03-04 01:33:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:30,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:30,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511602393] [2025-03-04 01:33:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511602393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238039982] [2025-03-04 01:33:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:30,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:30,680 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:31,085 INFO L93 Difference]: Finished difference Result 303 states and 429 transitions. [2025-03-04 01:33:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:33:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:31,090 INFO L225 Difference]: With dead ends: 303 [2025-03-04 01:33:31,090 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 01:33:31,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:31,091 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 123 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:31,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 521 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:33:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 01:33:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 174. [2025-03-04 01:33:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 143 states have internal predecessors, (191), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2025-03-04 01:33:31,117 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 119 [2025-03-04 01:33:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:31,117 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2025-03-04 01:33:31,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2025-03-04 01:33:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:33:31,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:31,119 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:31,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:33:31,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:31,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:31,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1023178946, now seen corresponding path program 1 times [2025-03-04 01:33:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:31,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071655860] [2025-03-04 01:33:31,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:31,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:31,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:31,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:33:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:33:31,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:33:31,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:31,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:31,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:33:31,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:31,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:31,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:31,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071655860] [2025-03-04 01:33:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071655860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:31,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424797991] [2025-03-04 01:33:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:31,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:31,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:31,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:31,633 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:31,677 INFO L93 Difference]: Finished difference Result 279 states and 396 transitions. [2025-03-04 01:33:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:31,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-04 01:33:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:31,681 INFO L225 Difference]: With dead ends: 279 [2025-03-04 01:33:31,681 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 01:33:31,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:31,682 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:31,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 01:33:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-04 01:33:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 147 states have internal predecessors, (195), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2025-03-04 01:33:31,695 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 119 [2025-03-04 01:33:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:31,695 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2025-03-04 01:33:31,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2025-03-04 01:33:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:33:31,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:31,697 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:31,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:33:31,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:31,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:31,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1911516392, now seen corresponding path program 1 times [2025-03-04 01:33:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:31,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114737141] [2025-03-04 01:33:31,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:31,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:31,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:31,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:31,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:33:32,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:33:32,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:33:32,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:32,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:32,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:33:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:32,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 01:33:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:33:32,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:32,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114737141] [2025-03-04 01:33:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114737141] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-04 01:33:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58827564] [2025-03-04 01:33:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:32,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:32,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:32,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:33:32,716 INFO L87 Difference]: Start difference. First operand 178 states and 251 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:32,793 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2025-03-04 01:33:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:33:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:32,796 INFO L225 Difference]: With dead ends: 345 [2025-03-04 01:33:32,796 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 01:33:32,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:33:32,797 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 58 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:32,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 606 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 01:33:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 198. [2025-03-04 01:33:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.347305389221557) internal successors, (225), 167 states have internal predecessors, (225), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 281 transitions. [2025-03-04 01:33:32,809 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 281 transitions. Word has length 121 [2025-03-04 01:33:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:32,813 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 281 transitions. [2025-03-04 01:33:32,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 281 transitions. [2025-03-04 01:33:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:33:32,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:32,814 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:32,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:33:33,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:33,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:33,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1527556301, now seen corresponding path program 1 times [2025-03-04 01:33:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93704369] [2025-03-04 01:33:33,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:33,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:33,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:33,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:33,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:33:33,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:33:33,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:33:33,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:33,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:33,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:33:33,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:33,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:33,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93704369] [2025-03-04 01:33:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93704369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:33,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:33,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:33,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110975680] [2025-03-04 01:33:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:33,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:33,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:33,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:33,300 INFO L87 Difference]: Start difference. First operand 198 states and 281 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:33,341 INFO L93 Difference]: Finished difference Result 317 states and 449 transitions. [2025-03-04 01:33:33,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:33:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:33,343 INFO L225 Difference]: With dead ends: 317 [2025-03-04 01:33:33,343 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 01:33:33,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:33,344 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:33,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 01:33:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2025-03-04 01:33:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 169 states have internal predecessors, (227), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2025-03-04 01:33:33,375 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 122 [2025-03-04 01:33:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:33,376 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2025-03-04 01:33:33,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2025-03-04 01:33:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:33,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:33,378 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:33,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:33:33,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:33,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:33,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash 255495831, now seen corresponding path program 1 times [2025-03-04 01:33:33,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642271809] [2025-03-04 01:33:33,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:33,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:33,581 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:33,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:33:33,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:33,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:33,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:33,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:33,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:33:33,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:33,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:33,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642271809] [2025-03-04 01:33:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642271809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:33,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804923864] [2025-03-04 01:33:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:33,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:33,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:33,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:33,853 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:33,962 INFO L93 Difference]: Finished difference Result 317 states and 448 transitions. [2025-03-04 01:33:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:33,963 INFO L225 Difference]: With dead ends: 317 [2025-03-04 01:33:33,964 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 01:33:33,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:33,964 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:33,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 01:33:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2025-03-04 01:33:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 171 states have internal predecessors, (229), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 285 transitions. [2025-03-04 01:33:33,972 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 285 transitions. Word has length 123 [2025-03-04 01:33:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:33,972 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 285 transitions. [2025-03-04 01:33:33,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 285 transitions. [2025-03-04 01:33:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:33,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:33,974 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:33,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:33:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:34,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:34,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1551958632, now seen corresponding path program 1 times [2025-03-04 01:33:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781034729] [2025-03-04 01:33:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:34,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:34,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:33:34,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:34,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:34,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:34,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:34,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:33:34,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:34,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:34,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:34,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781034729] [2025-03-04 01:33:34,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781034729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:34,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132509904] [2025-03-04 01:33:34,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:34,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:34,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:34,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:34,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:34,431 INFO L87 Difference]: Start difference. First operand 202 states and 285 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:34,536 INFO L93 Difference]: Finished difference Result 321 states and 452 transitions. [2025-03-04 01:33:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:34,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:34,538 INFO L225 Difference]: With dead ends: 321 [2025-03-04 01:33:34,538 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 01:33:34,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:34,539 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:34,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 549 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 01:33:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2025-03-04 01:33:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 173 states have internal predecessors, (231), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions. [2025-03-04 01:33:34,546 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 123 [2025-03-04 01:33:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:34,546 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions. [2025-03-04 01:33:34,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions. [2025-03-04 01:33:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:34,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:34,547 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:34,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:33:34,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:34,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash -664454951, now seen corresponding path program 1 times [2025-03-04 01:33:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112511526] [2025-03-04 01:33:34,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:34,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:34,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:34,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:34,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:33:34,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:34,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:34,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:34,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:35,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:33:35,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:35,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:35,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:35,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112511526] [2025-03-04 01:33:35,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112511526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:35,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:35,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:35,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088816885] [2025-03-04 01:33:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:35,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:35,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:35,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:35,050 INFO L87 Difference]: Start difference. First operand 204 states and 287 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:35,200 INFO L93 Difference]: Finished difference Result 325 states and 456 transitions. [2025-03-04 01:33:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:35,201 INFO L225 Difference]: With dead ends: 325 [2025-03-04 01:33:35,202 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 01:33:35,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:35,202 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:35,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 680 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 01:33:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2025-03-04 01:33:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 175 states have (on average 1.3314285714285714) internal successors, (233), 175 states have internal predecessors, (233), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 289 transitions. [2025-03-04 01:33:35,210 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 289 transitions. Word has length 123 [2025-03-04 01:33:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:35,210 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 289 transitions. [2025-03-04 01:33:35,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 289 transitions. [2025-03-04 01:33:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:35,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:35,211 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:35,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:33:35,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:35,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:35,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash -663531430, now seen corresponding path program 1 times [2025-03-04 01:33:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482383852] [2025-03-04 01:33:35,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:35,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:35,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:35,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:35,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:33:35,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:35,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:35,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:35,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:35,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 01:33:35,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:36,866 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 28 treesize of output 24 [2025-03-04 01:33:37,196 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 42 treesize of output 30 [2025-03-04 01:33:37,201 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 48 treesize of output 36 [2025-03-04 01:33:37,327 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 64 treesize of output 44 [2025-03-04 01:33:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 270 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 01:33:37,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:38,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482383852] [2025-03-04 01:33:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482383852] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:38,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:38,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 31 [2025-03-04 01:33:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726487166] [2025-03-04 01:33:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:38,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:33:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:38,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:33:38,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:33:38,241 INFO L87 Difference]: Start difference. First operand 206 states and 289 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,781 INFO L93 Difference]: Finished difference Result 518 states and 716 transitions. [2025-03-04 01:33:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:33:39,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,784 INFO L225 Difference]: With dead ends: 518 [2025-03-04 01:33:39,784 INFO L226 Difference]: Without dead ends: 398 [2025-03-04 01:33:39,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:33:39,785 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 275 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:39,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1623 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:33:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-04 01:33:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 334. [2025-03-04 01:33:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 296 states have (on average 1.3412162162162162) internal successors, (397), 297 states have internal predecessors, (397), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:33:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2025-03-04 01:33:39,804 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 465 transitions. Word has length 123 [2025-03-04 01:33:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,804 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 465 transitions. [2025-03-04 01:33:39,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 465 transitions. [2025-03-04 01:33:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:33:39,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,806 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:39,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:33:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:40,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:40,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash 598293496, now seen corresponding path program 1 times [2025-03-04 01:33:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:40,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063728196] [2025-03-04 01:33:40,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:40,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:40,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:40,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:40,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:33:40,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:33:40,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:33:40,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:40,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:40,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:33:40,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:33:40,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:40,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:40,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063728196] [2025-03-04 01:33:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063728196] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:40,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-04 01:33:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733057914] [2025-03-04 01:33:40,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:40,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:40,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:40,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:33:40,593 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:40,692 INFO L93 Difference]: Finished difference Result 647 states and 885 transitions. [2025-03-04 01:33:40,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:40,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-03-04 01:33:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:40,698 INFO L225 Difference]: With dead ends: 647 [2025-03-04 01:33:40,699 INFO L226 Difference]: Without dead ends: 401 [2025-03-04 01:33:40,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:33:40,700 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 62 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:40,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 626 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-04 01:33:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 309. [2025-03-04 01:33:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 271 states have (on average 1.3173431734317342) internal successors, (357), 272 states have internal predecessors, (357), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:33:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 425 transitions. [2025-03-04 01:33:40,712 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 425 transitions. Word has length 124 [2025-03-04 01:33:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:40,712 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 425 transitions. [2025-03-04 01:33:40,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 425 transitions. [2025-03-04 01:33:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:40,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:40,713 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:40,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:33:40,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:40,914 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:40,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash -474080696, now seen corresponding path program 1 times [2025-03-04 01:33:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355059216] [2025-03-04 01:33:40,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:40,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:40,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:40,918 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:40,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:33:41,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:41,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:41,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:33:41,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 01:33:46,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:33:46,120 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 156 treesize of output 86 [2025-03-04 01:33:46,124 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 167 treesize of output 107 [2025-03-04 01:33:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-04 01:33:46,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:51,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355059216] [2025-03-04 01:33:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355059216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1037790402] [2025-03-04 01:33:51,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:33:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:33:51,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:33:51,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-04 01:33:51,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:52,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:52,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:52,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:33:52,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:52,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:33:55,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:34:01,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:34:01,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 86 [2025-03-04 01:34:01,849 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 167 treesize of output 107 [2025-03-04 01:34:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-04 01:34:02,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:10,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1037790402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:10,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:34:10,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-04 01:34:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301530789] [2025-03-04 01:34:10,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:10,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:34:10,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:34:10,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:34:10,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:34:10,701 INFO L87 Difference]: Start difference. First operand 309 states and 425 transitions. Second operand has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 16 states have internal predecessors, (118), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:34:14,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:34:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:22,616 INFO L93 Difference]: Finished difference Result 616 states and 839 transitions. [2025-03-04 01:34:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:34:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 16 states have internal predecessors, (118), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 125 [2025-03-04 01:34:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:22,623 INFO L225 Difference]: With dead ends: 616 [2025-03-04 01:34:22,623 INFO L226 Difference]: Without dead ends: 614 [2025-03-04 01:34:22,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:34:22,624 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 608 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:22,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1092 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-04 01:34:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-04 01:34:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2025-03-04 01:34:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 535 states have (on average 1.3102803738317756) internal successors, (701), 539 states have internal predecessors, (701), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:34:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 833 transitions. [2025-03-04 01:34:22,664 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 833 transitions. Word has length 125 [2025-03-04 01:34:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:22,664 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 833 transitions. [2025-03-04 01:34:22,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 16 states have internal predecessors, (118), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:34:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 833 transitions. [2025-03-04 01:34:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:34:22,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:22,665 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:22,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2025-03-04 01:34:22,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-04 01:34:23,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:34:23,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:23,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -473157175, now seen corresponding path program 1 times [2025-03-04 01:34:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:34:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424330421] [2025-03-04 01:34:23,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:23,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:34:23,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:34:23,069 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:34:23,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-04 01:34:23,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:34:23,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:34:23,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:23,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:23,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:34:23,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:23,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 01:34:23,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 01:34:23,589 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 54 treesize of output 42 [2025-03-04 01:34:23,658 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 51 treesize of output 39 [2025-03-04 01:34:23,660 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 39 treesize of output 27 [2025-03-04 01:34:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:34:23,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:34:23,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:34:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424330421] [2025-03-04 01:34:23,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424330421] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:23,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:23,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2025-03-04 01:34:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796560321] [2025-03-04 01:34:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:23,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:34:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:34:23,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:34:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:34:23,958 INFO L87 Difference]: Start difference. First operand 610 states and 833 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:34:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:24,251 INFO L93 Difference]: Finished difference Result 1076 states and 1452 transitions. [2025-03-04 01:34:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:24,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-04 01:34:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:24,254 INFO L225 Difference]: With dead ends: 1076 [2025-03-04 01:34:24,254 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 01:34:24,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:34:24,259 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 333 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:24,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 723 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 01:34:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-03-04 01:34:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 553 states have (on average 1.2929475587703436) internal successors, (715), 557 states have internal predecessors, (715), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:34:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 847 transitions. [2025-03-04 01:34:24,309 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 847 transitions. Word has length 125 [2025-03-04 01:34:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 847 transitions. [2025-03-04 01:34:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:34:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 847 transitions. [2025-03-04 01:34:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:34:24,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:24,313 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:24,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-04 01:34:24,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:34:24,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:24,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:24,514 INFO L85 PathProgramCache]: Analyzing trace with hash 414346506, now seen corresponding path program 1 times [2025-03-04 01:34:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:34:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309659150] [2025-03-04 01:34:24,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:24,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:34:24,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:34:24,517 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:34:24,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-04 01:34:24,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:34:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:34:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:24,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:34:24,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:26,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 01:34:29,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:34:29,448 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 156 treesize of output 86 [2025-03-04 01:34:29,451 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 167 treesize of output 107 [2025-03-04 01:34:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:34:29,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:34,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:34:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309659150] [2025-03-04 01:34:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309659150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [64539384] [2025-03-04 01:34:34,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:34,291 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:34:34,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:34:34,293 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:34:34,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-03-04 01:34:34,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:34:35,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:34:35,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:35,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:35,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:34:35,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:36,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:38,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:34:42,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:34:42,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 86 [2025-03-04 01:34:42,125 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 167 treesize of output 107 [2025-03-04 01:34:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:34:42,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [64539384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:46,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:34:46,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-04 01:34:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952562379] [2025-03-04 01:34:46,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:46,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:34:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:34:46,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:34:46,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:34:46,145 INFO L87 Difference]: Start difference. First operand 634 states and 847 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 15 states have internal predecessors, (114), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)