./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.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 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:47:54,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:47:54,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:47:54,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:47:54,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:47:55,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:47:55,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:47:55,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:47:55,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:47:55,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:47:55,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:47:55,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:47:55,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:47:55,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:47:55,016 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:47:55,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:47:55,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:47:55,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:47:55,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:47:55,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:47:55,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:47:55,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:47:55,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:47:55,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:47:55,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:47:55,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:47:55,019 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 -> 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e [2025-03-17 05:47:55,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:47:55,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:47:55,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:47:55,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:47:55,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:47:55,298 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-54.i [2025-03-17 05:47:56,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1615be59d/44fbbdb06710400fb6952bc687ab8885/FLAG07a0a0546 [2025-03-17 05:47:56,732 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:47:56,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i [2025-03-17 05:47:56,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1615be59d/44fbbdb06710400fb6952bc687ab8885/FLAG07a0a0546 [2025-03-17 05:47:56,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1615be59d/44fbbdb06710400fb6952bc687ab8885 [2025-03-17 05:47:56,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:47:56,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:47:56,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:47:56,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:47:56,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:47:56,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:47:56" (1/1) ... [2025-03-17 05:47:56,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649a78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:56, skipping insertion in model container [2025-03-17 05:47:56,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:47:56" (1/1) ... [2025-03-17 05:47:56,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:47:56,874 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-54.i[916,929] [2025-03-17 05:47:56,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:47:56,942 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:47:56,953 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-54.i[916,929] [2025-03-17 05:47:56,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:47:57,003 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:47:57,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57 WrapperNode [2025-03-17 05:47:57,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:47:57,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:47:57,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:47:57,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:47:57,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,059 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2025-03-17 05:47:57,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:47:57,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:47:57,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:47:57,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:47:57,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,098 INFO L175 MemorySlicer]: Split 115 memory accesses to 13 slices as follows [2, 9, 10, 9, 6, 10, 8, 13, 18, 10, 7, 7, 6]. 16 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2025-03-17 05:47:57,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:47:57,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:47:57,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:47:57,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:47:57,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (1/1) ... [2025-03-17 05:47:57,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:47:57,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:47:57,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:47:57,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:47:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:47:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:47:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:47:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:47:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:47:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:47:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:47:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:47:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:47:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:47:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:47:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:47:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:47:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:47:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:47:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:47:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:47:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:47:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:47:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:47:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:47:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:47:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:47:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:47:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:47:57,345 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:47:57,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:47:57,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem72#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~ite99#1;havoc property_#t~mem81#1;havoc property_#t~ite96#1;havoc property_#t~mem86#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~mem101#1;havoc property_#t~ite119#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite118#1;havoc property_#t~mem113#1;havoc property_#t~mem104#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:47:57,758 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-17 05:47:57,758 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:47:57,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:47:57,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:47:57,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:47:57 BoogieIcfgContainer [2025-03-17 05:47:57,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:47:57,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:47:57,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:47:57,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:47:57,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:47:56" (1/3) ... [2025-03-17 05:47:57,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5839a2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:47:57, skipping insertion in model container [2025-03-17 05:47:57,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:47:57" (2/3) ... [2025-03-17 05:47:57,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5839a2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:47:57, skipping insertion in model container [2025-03-17 05:47:57,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:47:57" (3/3) ... [2025-03-17 05:47:57,780 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-54.i [2025-03-17 05:47:57,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:47:57,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-54.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:47:57,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:47:57,860 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;@1274c1f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:47:57,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:47:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:47:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:47:57,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:57,874 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:47:57,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:57,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1702524976, now seen corresponding path program 1 times [2025-03-17 05:47:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:47:57,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228755373] [2025-03-17 05:47:57,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:57,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:47:58,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:47:58,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:47:58,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:58,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:47:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:47:58,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228755373] [2025-03-17 05:47:58,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228755373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:58,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446524802] [2025-03-17 05:47:58,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:58,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:47:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:47:58,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:47:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:47:58,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:47:58,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:47:58,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:58,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:58,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:47:58,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:47:58,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446524802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:47:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:47:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924326907] [2025-03-17 05:47:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:58,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:47:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:47:58,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:47:58,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:47:58,412 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:47:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:58,429 INFO L93 Difference]: Finished difference Result 205 states and 320 transitions. [2025-03-17 05:47:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:47:58,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-03-17 05:47:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:58,435 INFO L225 Difference]: With dead ends: 205 [2025-03-17 05:47:58,435 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 05:47:58,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:47:58,439 INFO L435 NwaCegarLoop]: 151 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, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:58,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:47:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 05:47:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 05:47:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:47:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-03-17 05:47:58,467 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 101 [2025-03-17 05:47:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:58,467 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-17 05:47:58,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:47:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2025-03-17 05:47:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:47:58,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:58,470 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:47:58,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:47:58,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:47:58,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:58,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash 121721754, now seen corresponding path program 1 times [2025-03-17 05:47:58,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:47:58,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132417308] [2025-03-17 05:47:58,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:58,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:47:58,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:47:58,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:47:58,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:58,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:47:58,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:47:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132417308] [2025-03-17 05:47:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132417308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100371190] [2025-03-17 05:47:58,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:58,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:47:58,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:47:59,001 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:47:59,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:47:59,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:47:59,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:47:59,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:59,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:59,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:47:59,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:47:59,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100371190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:59,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:47:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:47:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535023271] [2025-03-17 05:47:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:59,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:47:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:47:59,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:47:59,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:47:59,244 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:47:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:59,287 INFO L93 Difference]: Finished difference Result 206 states and 305 transitions. [2025-03-17 05:47:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:47:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-17 05:47:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:59,289 INFO L225 Difference]: With dead ends: 206 [2025-03-17 05:47:59,289 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:47:59,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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-17 05:47:59,291 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:59,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:47:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:47:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-17 05:47:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:47:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2025-03-17 05:47:59,306 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 101 [2025-03-17 05:47:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:59,307 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2025-03-17 05:47:59,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:47:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2025-03-17 05:47:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:47:59,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:59,309 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:47:59,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:47:59,510 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-17 05:47:59,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:59,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1009225435, now seen corresponding path program 1 times [2025-03-17 05:47:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:47:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729456702] [2025-03-17 05:47:59,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:47:59,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:47:59,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:47:59,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:59,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:47:59,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:47:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729456702] [2025-03-17 05:47:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729456702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366851148] [2025-03-17 05:47:59,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:59,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:47:59,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:47:59,725 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-17 05:47:59,727 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-17 05:47:59,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:47:59,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:47:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:59,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:47:59,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:47:59,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366851148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:59,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:47:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:47:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591685636] [2025-03-17 05:47:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:59,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:47:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:47:59,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:47:59,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:47:59,943 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:47:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:59,981 INFO L93 Difference]: Finished difference Result 210 states and 309 transitions. [2025-03-17 05:47:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:47:59,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-17 05:47:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:59,985 INFO L225 Difference]: With dead ends: 210 [2025-03-17 05:47:59,985 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:47:59,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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-17 05:47:59,988 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:59,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:47:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:47:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-03-17 05:47:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:47:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-17 05:47:59,999 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 101 [2025-03-17 05:47:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:00,000 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-17 05:48:00,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-03-17 05:48:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:48:00,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:00,002 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:00,020 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-17 05:48:00,202 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-17 05:48:00,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:00,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1010148956, now seen corresponding path program 1 times [2025-03-17 05:48:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778852094] [2025-03-17 05:48:00,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:00,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:48:00,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:48:00,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:00,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:48:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:00,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778852094] [2025-03-17 05:48:00,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778852094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:00,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005600701] [2025-03-17 05:48:00,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:00,350 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-17 05:48:00,352 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-17 05:48:00,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:48:00,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:48:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:00,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:00,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:00,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005600701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:00,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:48:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393185756] [2025-03-17 05:48:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:00,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:00,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:00,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:00,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:48:00,567 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:00,587 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2025-03-17 05:48:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:00,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-17 05:48:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:00,590 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:48:00,590 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:48:00,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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-17 05:48:00,591 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 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-17 05:48:00,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:48:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 05:48:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:48:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-03-17 05:48:00,604 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 101 [2025-03-17 05:48:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:00,604 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-03-17 05:48:00,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-03-17 05:48:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:48:00,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:00,605 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:00,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:48:00,805 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-17 05:48:00,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:00,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash -86692806, now seen corresponding path program 1 times [2025-03-17 05:48:00,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:00,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547315209] [2025-03-17 05:48:00,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:00,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:48:00,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:48:00,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:00,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:00,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:00,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547315209] [2025-03-17 05:48:00,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547315209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:00,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:00,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:00,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619537881] [2025-03-17 05:48:00,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:00,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:00,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:00,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:00,976 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:01,072 INFO L93 Difference]: Finished difference Result 315 states and 458 transitions. [2025-03-17 05:48:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:01,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-17 05:48:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:01,074 INFO L225 Difference]: With dead ends: 315 [2025-03-17 05:48:01,074 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 05:48:01,075 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-17 05:48:01,075 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 133 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:01,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 544 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 05:48:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 129. [2025-03-17 05:48:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 115 states have internal predecessors, (166), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:48:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2025-03-17 05:48:01,089 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 103 [2025-03-17 05:48:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:01,089 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2025-03-17 05:48:01,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2025-03-17 05:48:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:48:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:01,090 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:01,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:48:01,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash 21379009, now seen corresponding path program 1 times [2025-03-17 05:48:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:01,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414424572] [2025-03-17 05:48:01,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:01,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:01,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:48:01,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:48:01,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:01,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:01,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414424572] [2025-03-17 05:48:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414424572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:48:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315502822] [2025-03-17 05:48:01,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:01,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:01,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:48:01,276 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:01,306 INFO L93 Difference]: Finished difference Result 360 states and 528 transitions. [2025-03-17 05:48:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:48:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:01,308 INFO L225 Difference]: With dead ends: 360 [2025-03-17 05:48:01,308 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 05:48:01,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:01,309 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 109 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 430 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-17 05:48:01,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 430 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 05:48:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2025-03-17 05:48:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.4228855721393034) internal successors, (286), 201 states have internal predecessors, (286), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 334 transitions. [2025-03-17 05:48:01,321 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 334 transitions. Word has length 104 [2025-03-17 05:48:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:01,322 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 334 transitions. [2025-03-17 05:48:01,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 334 transitions. [2025-03-17 05:48:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:48:01,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:01,323 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:01,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:48:01,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:01,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash -387445216, now seen corresponding path program 1 times [2025-03-17 05:48:01,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880854889] [2025-03-17 05:48:01,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:01,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:48:01,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:48:01,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:01,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:01,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880854889] [2025-03-17 05:48:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880854889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:01,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:01,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267962629] [2025-03-17 05:48:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:01,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:01,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:01,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:01,549 INFO L87 Difference]: Start difference. First operand 228 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:01,628 INFO L93 Difference]: Finished difference Result 459 states and 671 transitions. [2025-03-17 05:48:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:01,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:48:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:01,631 INFO L225 Difference]: With dead ends: 459 [2025-03-17 05:48:01,631 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 05:48:01,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:48:01,633 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 101 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:01,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 545 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 05:48:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2025-03-17 05:48:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.4179104477611941) internal successors, (285), 201 states have internal predecessors, (285), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 333 transitions. [2025-03-17 05:48:01,648 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 333 transitions. Word has length 104 [2025-03-17 05:48:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:01,649 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 333 transitions. [2025-03-17 05:48:01,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 333 transitions. [2025-03-17 05:48:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:48:01,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:01,651 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:01,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:48:01,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash -680848223, now seen corresponding path program 1 times [2025-03-17 05:48:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:01,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-03-17 05:48:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:01,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:48:01,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:48:01,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:01,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-03-17 05:48:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267637413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:02,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:02,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:48:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993052818] [2025-03-17 05:48:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:02,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:48:02,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:02,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:48:02,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:48:02,362 INFO L87 Difference]: Start difference. First operand 228 states and 333 transitions. Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:48:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:02,665 INFO L93 Difference]: Finished difference Result 583 states and 838 transitions. [2025-03-17 05:48:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:48:02,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2025-03-17 05:48:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:02,669 INFO L225 Difference]: With dead ends: 583 [2025-03-17 05:48:02,669 INFO L226 Difference]: Without dead ends: 356 [2025-03-17 05:48:02,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:48:02,670 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 447 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:02,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 869 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:48:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-17 05:48:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2025-03-17 05:48:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 311 states have (on average 1.3794212218649518) internal successors, (429), 313 states have internal predecessors, (429), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 501 transitions. [2025-03-17 05:48:02,696 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 501 transitions. Word has length 104 [2025-03-17 05:48:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:02,697 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 501 transitions. [2025-03-17 05:48:02,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:48:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 501 transitions. [2025-03-17 05:48:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:02,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:02,698 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:02,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:48:02,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:02,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1707799544, now seen corresponding path program 1 times [2025-03-17 05:48:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:02,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489113332] [2025-03-17 05:48:02,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:02,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:02,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:02,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:02,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:03,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489113332] [2025-03-17 05:48:03,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489113332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:03,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:03,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:48:03,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009612454] [2025-03-17 05:48:03,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:48:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:03,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:48:03,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:48:03,418 INFO L87 Difference]: Start difference. First operand 352 states and 501 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:03,646 INFO L93 Difference]: Finished difference Result 666 states and 951 transitions. [2025-03-17 05:48:03,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:48:03,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:03,651 INFO L225 Difference]: With dead ends: 666 [2025-03-17 05:48:03,651 INFO L226 Difference]: Without dead ends: 473 [2025-03-17 05:48:03,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:48:03,653 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 86 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:03,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1597 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-17 05:48:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 380. [2025-03-17 05:48:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 339 states have (on average 1.392330383480826) internal successors, (472), 341 states have internal predecessors, (472), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 544 transitions. [2025-03-17 05:48:03,682 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 544 transitions. Word has length 105 [2025-03-17 05:48:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:03,682 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 544 transitions. [2025-03-17 05:48:03,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 544 transitions. [2025-03-17 05:48:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:03,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:03,684 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:48:03,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1202240919, now seen corresponding path program 1 times [2025-03-17 05:48:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671525635] [2025-03-17 05:48:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:03,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:03,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:03,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:03,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671525635] [2025-03-17 05:48:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671525635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:03,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862540075] [2025-03-17 05:48:03,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:03,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:03,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:03,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:03,873 INFO L87 Difference]: Start difference. First operand 380 states and 544 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:03,940 INFO L93 Difference]: Finished difference Result 684 states and 979 transitions. [2025-03-17 05:48:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:03,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:03,945 INFO L225 Difference]: With dead ends: 684 [2025-03-17 05:48:03,946 INFO L226 Difference]: Without dead ends: 463 [2025-03-17 05:48:03,947 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-17 05:48:03,948 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 79 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:03,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 802 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-17 05:48:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 380. [2025-03-17 05:48:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 339 states have (on average 1.3864306784660767) internal successors, (470), 341 states have internal predecessors, (470), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 542 transitions. [2025-03-17 05:48:03,984 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 542 transitions. Word has length 105 [2025-03-17 05:48:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:03,984 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 542 transitions. [2025-03-17 05:48:03,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 542 transitions. [2025-03-17 05:48:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:03,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:03,989 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:03,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:48:03,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1640792791, now seen corresponding path program 1 times [2025-03-17 05:48:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:03,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-03-17 05:48:03,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:04,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:04,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:04,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-03-17 05:48:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240293658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641983767] [2025-03-17 05:48:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:04,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:04,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:04,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:04,155 INFO L87 Difference]: Start difference. First operand 380 states and 542 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:04,218 INFO L93 Difference]: Finished difference Result 685 states and 976 transitions. [2025-03-17 05:48:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:04,221 INFO L225 Difference]: With dead ends: 685 [2025-03-17 05:48:04,221 INFO L226 Difference]: Without dead ends: 464 [2025-03-17 05:48:04,222 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-17 05:48:04,222 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 81 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:04,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 781 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-17 05:48:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 380. [2025-03-17 05:48:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 339 states have (on average 1.3805309734513274) internal successors, (468), 341 states have internal predecessors, (468), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 540 transitions. [2025-03-17 05:48:04,239 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 540 transitions. Word has length 105 [2025-03-17 05:48:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 540 transitions. [2025-03-17 05:48:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 540 transitions. [2025-03-17 05:48:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:04,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:04,241 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:04,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:48:04,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:04,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1135234166, now seen corresponding path program 1 times [2025-03-17 05:48:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:04,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111311561] [2025-03-17 05:48:04,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:04,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:04,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:04,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111311561] [2025-03-17 05:48:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111311561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:04,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:04,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:48:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886255867] [2025-03-17 05:48:04,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:04,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:48:04,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:04,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:48:04,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:48:04,578 INFO L87 Difference]: Start difference. First operand 380 states and 540 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:04,746 INFO L93 Difference]: Finished difference Result 768 states and 1091 transitions. [2025-03-17 05:48:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:48:04,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:04,748 INFO L225 Difference]: With dead ends: 768 [2025-03-17 05:48:04,749 INFO L226 Difference]: Without dead ends: 547 [2025-03-17 05:48:04,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:48:04,750 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 140 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:04,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1915 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-17 05:48:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 534. [2025-03-17 05:48:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 473 states have (on average 1.372093023255814) internal successors, (649), 476 states have internal predecessors, (649), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:48:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 757 transitions. [2025-03-17 05:48:04,778 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 757 transitions. Word has length 105 [2025-03-17 05:48:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:04,778 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 757 transitions. [2025-03-17 05:48:04,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 757 transitions. [2025-03-17 05:48:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:48:04,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:04,779 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:04,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:48:04,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:04,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash 277858029, now seen corresponding path program 1 times [2025-03-17 05:48:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:04,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821926447] [2025-03-17 05:48:04,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:04,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:48:04,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:48:04,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:04,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821926447] [2025-03-17 05:48:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821926447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:48:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249151092] [2025-03-17 05:48:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:04,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:48:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:04,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:48:04,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:48:04,991 INFO L87 Difference]: Start difference. First operand 534 states and 757 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:05,063 INFO L93 Difference]: Finished difference Result 601 states and 841 transitions. [2025-03-17 05:48:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:48:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-17 05:48:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:05,070 INFO L225 Difference]: With dead ends: 601 [2025-03-17 05:48:05,070 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 05:48:05,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:48:05,071 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 124 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:05,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 817 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 05:48:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2025-03-17 05:48:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 523 states have (on average 1.3479923518164436) internal successors, (705), 527 states have internal predecessors, (705), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 05:48:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 833 transitions. [2025-03-17 05:48:05,103 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 833 transitions. Word has length 106 [2025-03-17 05:48:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:05,103 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 833 transitions. [2025-03-17 05:48:05,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 833 transitions. [2025-03-17 05:48:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:48:05,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:05,105 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:05,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:48:05,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:05,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash 278781550, now seen corresponding path program 1 times [2025-03-17 05:48:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881933623] [2025-03-17 05:48:05,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:05,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:05,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:48:05,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:48:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:48:05,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:48:05,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:48:05,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:48:05,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:05,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:48:05,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:48:05,265 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:48:05,265 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:48:05,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:48:05,269 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:05,415 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:48:05,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:48:05 BoogieIcfgContainer [2025-03-17 05:48:05,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:48:05,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:48:05,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:48:05,420 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:48:05,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:47:57" (3/4) ... [2025-03-17 05:48:05,422 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:48:05,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:48:05,423 INFO L158 Benchmark]: Toolchain (without parser) took 8671.30ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 114.1MB in the beginning and 227.7MB in the end (delta: -113.5MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2025-03-17 05:48:05,423 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:48:05,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.31ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 100.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:48:05,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.44ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 96.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:48:05,424 INFO L158 Benchmark]: Boogie Preprocessor took 75.23ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:48:05,424 INFO L158 Benchmark]: IcfgBuilder took 637.63ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 56.1MB in the end (delta: 36.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 05:48:05,424 INFO L158 Benchmark]: TraceAbstraction took 7644.47ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 55.7MB in the beginning and 227.7MB in the end (delta: -172.0MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2025-03-17 05:48:05,424 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 293.6MB. Free memory was 227.7MB in the beginning and 227.7MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:48:05,425 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.31ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 100.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.44ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 96.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.23ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 92.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 637.63ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 56.1MB in the end (delta: 36.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7644.47ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 55.7MB in the beginning and 227.7MB in the end (delta: -172.0MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 293.6MB. Free memory was 227.7MB in the beginning and 227.7MB in the end (delta: 60.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 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L22] unsigned char var_1_1 = 16; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 10; [L24] unsigned char var_1_3 = 10; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_4 = 0; [L26] unsigned char var_1_4 = 0; [L27] unsigned char* var_1_4_Pointer = &(var_1_4); [L28] unsigned char var_1_6 = 1; [L28] unsigned char var_1_6 = 1; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_9 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] unsigned char var_1_10 = 0; [L32] unsigned char var_1_10 = 0; [L33] unsigned char* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 9.75; [L34] double var_1_11 = 9.75; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] double var_1_12 = 5.5; [L36] double var_1_12 = 5.5; [L37] double* var_1_12_Pointer = &(var_1_12); [L38] double var_1_13 = 4.1; [L38] double var_1_13 = 4.1; [L39] double* var_1_13_Pointer = &(var_1_13); [L40] float var_1_14 = 9.8; [L40] float var_1_14 = 9.8; [L41] float* var_1_14_Pointer = &(var_1_14); [L42] signed char var_1_15 = 25; [L42] signed char var_1_15 = 25; [L43] signed char* var_1_15_Pointer = &(var_1_15); [L44] signed char var_1_16 = 2; [L44] signed char var_1_16 = 2; [L45] signed char* var_1_16_Pointer = &(var_1_16); [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L81] var_1_3 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] var_1_6 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] var_1_9 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] var_1_10 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] var_1_12 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_12) [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L94] EXPR \read(var_1_12) [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] var_1_13 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_13) [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L96] EXPR \read(var_1_13) [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L97] var_1_16 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L112] RET updateVariables() [L113] CALL step() [L49] EXPR \read(*var_1_12_Pointer) [L49] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L50] EXPR \read(*var_1_16_Pointer) [L50] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L51] signed long int stepLocal_0 = -4; [L52] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L52] COND FALSE !(stepLocal_0 >= (*(var_1_15_Pointer))) [L55] EXPR \read(*var_1_3_Pointer) [L55] unsigned char stepLocal_2 = (*(var_1_3_Pointer)); [L56] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L56] COND FALSE !((*(var_1_9_Pointer))) [L65] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) [L65] EXPR \read(*var_1_1_Pointer) [L65] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) VAL [isInitial=1, stepLocal_2=254, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] signed long int stepLocal_1 = (((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))); [L66] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L66] COND FALSE !((8 * (*(var_1_1_Pointer))) == stepLocal_1) [L77] EXPR \read(*var_1_10_Pointer) [L77] (*(var_1_4_Pointer)) = (*(var_1_10_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L104] EXPR (-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) [L104] EXPR \read(*var_1_4_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) [L104] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1 [L104] EXPR (*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1 VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR \read(*var_1_12_Pointer) [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104-L105] return (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 167 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1302 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1302 mSDsluCounter, 9756 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7462 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 853 IncrementalHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 2294 mSDtfsCounter, 853 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 429 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=13, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 367 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1855 NumberOfCodeBlocks, 1855 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1732 ConstructedInterpolants, 0 QuantifiedInterpolants, 3243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 4367/4488 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:48:05,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-54.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 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:48:07,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:48:07,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:48:07,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:48:07,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:48:07,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:48:07,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:48:07,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:48:07,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:48:07,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:48:07,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:48:07,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:48:07,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:48:07,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:48:07,554 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:48:07,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:48:07,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:48:07,554 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:48:07,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:48:07,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:48:07,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:48:07,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:48:07,556 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 -> 803841a343f4a7b18ae8961ad2990e50b3678fbcd0340baeebfb73af8679dd6e [2025-03-17 05:48:07,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:48:07,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:48:07,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:48:07,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:48:07,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:48:07,828 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-54.i [2025-03-17 05:48:08,991 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0271ee7f/4ee04a92bce247fd8773ee3d0973dd87/FLAGc53305da6 [2025-03-17 05:48:09,187 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:48:09,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i [2025-03-17 05:48:09,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0271ee7f/4ee04a92bce247fd8773ee3d0973dd87/FLAGc53305da6 [2025-03-17 05:48:09,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0271ee7f/4ee04a92bce247fd8773ee3d0973dd87 [2025-03-17 05:48:09,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:48:09,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:48:09,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:48:09,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:48:09,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:48:09,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72622d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09, skipping insertion in model container [2025-03-17 05:48:09,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:48:09,339 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-54.i[916,929] [2025-03-17 05:48:09,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:48:09,408 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:48:09,418 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-54.i[916,929] [2025-03-17 05:48:09,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:48:09,467 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:48:09,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09 WrapperNode [2025-03-17 05:48:09,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:48:09,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:48:09,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:48:09,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:48:09,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,525 INFO L138 Inliner]: procedures = 33, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-17 05:48:09,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:48:09,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:48:09,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:48:09,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:48:09,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,571 INFO L175 MemorySlicer]: Split 115 memory accesses to 13 slices as follows [2, 9, 10, 9, 6, 10, 8, 13, 18, 10, 7, 7, 6]. 16 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2025-03-17 05:48:09,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:48:09,636 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:48:09,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:48:09,637 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:48:09,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (1/1) ... [2025-03-17 05:48:09,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:48:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:09,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:48:09,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:48:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:48:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:48:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:48:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-17 05:48:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:48:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:48:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:48:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-17 05:48:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:48:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:48:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:48:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:48:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:48:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:48:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:48:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:48:09,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:48:09,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:48:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:48:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:48:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-17 05:48:09,863 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:48:09,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:48:10,768 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem72#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~ite99#1;havoc property_#t~mem81#1;havoc property_#t~ite96#1;havoc property_#t~mem86#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~mem101#1;havoc property_#t~ite119#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite118#1;havoc property_#t~mem113#1;havoc property_#t~mem104#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:48:10,805 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-03-17 05:48:10,805 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:48:10,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:48:10,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:48:10,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:48:10 BoogieIcfgContainer [2025-03-17 05:48:10,812 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:48:10,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:48:10,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:48:10,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:48:10,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:48:09" (1/3) ... [2025-03-17 05:48:10,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3305a3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:48:10, skipping insertion in model container [2025-03-17 05:48:10,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:09" (2/3) ... [2025-03-17 05:48:10,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3305a3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:48:10, skipping insertion in model container [2025-03-17 05:48:10,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:48:10" (3/3) ... [2025-03-17 05:48:10,819 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-54.i [2025-03-17 05:48:10,829 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:48:10,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-54.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:48:10,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:48:10,887 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;@1833b9c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:48:10,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:48:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:48:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:48:10,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:10,897 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:10,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:10,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1702524976, now seen corresponding path program 1 times [2025-03-17 05:48:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:10,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314523546] [2025-03-17 05:48:10,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:10,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:10,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:10,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:48:11,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:48:11,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:48:11,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:11,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:11,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:48:11,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-17 05:48:11,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:11,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314523546] [2025-03-17 05:48:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314523546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:48:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834900570] [2025-03-17 05:48:11,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:11,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:48:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:11,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:48:11,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:48:11,330 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:48:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:11,354 INFO L93 Difference]: Finished difference Result 205 states and 320 transitions. [2025-03-17 05:48:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:48:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-03-17 05:48:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:11,362 INFO L225 Difference]: With dead ends: 205 [2025-03-17 05:48:11,362 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 05:48:11,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:48:11,368 INFO L435 NwaCegarLoop]: 151 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, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:11,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 05:48:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 05:48:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:48:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-03-17 05:48:11,409 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 101 [2025-03-17 05:48:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:11,410 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-17 05:48:11,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:48:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2025-03-17 05:48:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:48:11,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:11,414 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:11,424 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-17 05:48:11,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:11,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:11,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 121721754, now seen corresponding path program 1 times [2025-03-17 05:48:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937505766] [2025-03-17 05:48:11,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:11,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:11,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:11,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:11,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:48:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:48:11,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:48:11,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:11,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:11,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:48:11,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:12,153 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-17 05:48:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:12,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:12,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937505766] [2025-03-17 05:48:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937505766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:48:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003876124] [2025-03-17 05:48:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:12,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:12,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:48:12,167 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:12,315 INFO L93 Difference]: Finished difference Result 304 states and 451 transitions. [2025-03-17 05:48:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-17 05:48:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:12,320 INFO L225 Difference]: With dead ends: 304 [2025-03-17 05:48:12,320 INFO L226 Difference]: Without dead ends: 203 [2025-03-17 05:48:12,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:12,321 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 99 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:12,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-17 05:48:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2025-03-17 05:48:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 172 states have (on average 1.441860465116279) internal successors, (248), 172 states have internal predecessors, (248), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 296 transitions. [2025-03-17 05:48:12,347 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 296 transitions. Word has length 101 [2025-03-17 05:48:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:12,348 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 296 transitions. [2025-03-17 05:48:12,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 296 transitions. [2025-03-17 05:48:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:48:12,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:12,353 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:12,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:48:12,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:12,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:12,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:12,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1475031451, now seen corresponding path program 1 times [2025-03-17 05:48:12,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:12,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419998118] [2025-03-17 05:48:12,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:12,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:12,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:12,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:12,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:48:12,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:48:12,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:48:12,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:12,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:12,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:12,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:12,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:12,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419998118] [2025-03-17 05:48:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419998118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:48:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656735050] [2025-03-17 05:48:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:12,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:12,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:12,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:48:12,942 INFO L87 Difference]: Start difference. First operand 199 states and 296 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:12,975 INFO L93 Difference]: Finished difference Result 401 states and 597 transitions. [2025-03-17 05:48:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-17 05:48:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:12,978 INFO L225 Difference]: With dead ends: 401 [2025-03-17 05:48:12,978 INFO L226 Difference]: Without dead ends: 203 [2025-03-17 05:48:12,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:48:12,980 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 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-17 05:48:12,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-17 05:48:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-17 05:48:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 176 states have (on average 1.4318181818181819) internal successors, (252), 176 states have internal predecessors, (252), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 300 transitions. [2025-03-17 05:48:12,997 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 300 transitions. Word has length 101 [2025-03-17 05:48:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:12,999 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 300 transitions. [2025-03-17 05:48:12,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 300 transitions. [2025-03-17 05:48:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:48:13,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:13,003 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:13,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:48:13,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:13,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:13,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1819591879, now seen corresponding path program 1 times [2025-03-17 05:48:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:13,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466453923] [2025-03-17 05:48:13,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:13,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:13,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:13,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:13,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:48:13,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:48:13,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:48:13,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:13,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:13,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:48:13,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:13,722 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-17 05:48:13,743 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 19 treesize of output 11 [2025-03-17 05:48:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:13,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:13,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:13,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466453923] [2025-03-17 05:48:13,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466453923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:13,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:48:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622608504] [2025-03-17 05:48:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:13,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:48:13,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:13,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:48:13,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:48:13,839 INFO L87 Difference]: Start difference. First operand 203 states and 300 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:14,177 INFO L93 Difference]: Finished difference Result 422 states and 621 transitions. [2025-03-17 05:48:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:48:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-17 05:48:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:14,184 INFO L225 Difference]: With dead ends: 422 [2025-03-17 05:48:14,184 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 05:48:14,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:48:14,187 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 103 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:14,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1051 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:48:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 05:48:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2025-03-17 05:48:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 187 states have (on average 1.4064171122994653) internal successors, (263), 187 states have internal predecessors, (263), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 311 transitions. [2025-03-17 05:48:14,214 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 311 transitions. Word has length 103 [2025-03-17 05:48:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:14,215 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 311 transitions. [2025-03-17 05:48:14,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 311 transitions. [2025-03-17 05:48:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:48:14,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:14,216 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:14,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:48:14,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:14,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:14,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash -932088198, now seen corresponding path program 1 times [2025-03-17 05:48:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578260800] [2025-03-17 05:48:14,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:14,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:14,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:14,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:48:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:48:14,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:48:14,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:14,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:14,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:48:14,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:14,847 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-17 05:48:14,867 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 19 treesize of output 11 [2025-03-17 05:48:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:14,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:14,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578260800] [2025-03-17 05:48:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578260800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:48:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336575804] [2025-03-17 05:48:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:48:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:14,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:48:14,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:48:14,950 INFO L87 Difference]: Start difference. First operand 214 states and 311 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:15,305 INFO L93 Difference]: Finished difference Result 437 states and 633 transitions. [2025-03-17 05:48:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:48:15,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-17 05:48:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:15,307 INFO L225 Difference]: With dead ends: 437 [2025-03-17 05:48:15,307 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 05:48:15,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:48:15,308 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 105 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:15,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1171 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:48:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 05:48:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2025-03-17 05:48:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 191 states have internal predecessors, (267), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 315 transitions. [2025-03-17 05:48:15,317 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 315 transitions. Word has length 103 [2025-03-17 05:48:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:15,317 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 315 transitions. [2025-03-17 05:48:15,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 315 transitions. [2025-03-17 05:48:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:48:15,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:15,318 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:15,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:48:15,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:15,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:15,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash -931164677, now seen corresponding path program 1 times [2025-03-17 05:48:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:15,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037352828] [2025-03-17 05:48:15,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:15,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:15,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:15,522 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:48:15,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:48:15,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:48:15,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:15,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:15,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:48:15,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:15,810 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 19 treesize of output 11 [2025-03-17 05:48:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:15,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:15,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:15,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037352828] [2025-03-17 05:48:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037352828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:15,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:15,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:15,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117734346] [2025-03-17 05:48:15,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:15,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:15,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:15,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:15,832 INFO L87 Difference]: Start difference. First operand 218 states and 315 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:16,241 INFO L93 Difference]: Finished difference Result 526 states and 763 transitions. [2025-03-17 05:48:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:16,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-17 05:48:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:16,243 INFO L225 Difference]: With dead ends: 526 [2025-03-17 05:48:16,243 INFO L226 Difference]: Without dead ends: 309 [2025-03-17 05:48:16,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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-17 05:48:16,245 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 133 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:16,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 547 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:48:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-17 05:48:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 230. [2025-03-17 05:48:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 203 states have (on average 1.4187192118226601) internal successors, (288), 203 states have internal predecessors, (288), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2025-03-17 05:48:16,276 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 103 [2025-03-17 05:48:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:16,277 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2025-03-17 05:48:16,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2025-03-17 05:48:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:48:16,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:16,278 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:16,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:48:16,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:16,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:16,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash -387445216, now seen corresponding path program 1 times [2025-03-17 05:48:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:16,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478152140] [2025-03-17 05:48:16,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:16,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:16,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:16,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:16,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:48:16,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:48:16,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:48:16,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:16,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:16,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:48:16,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:16,919 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-17 05:48:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:16,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:16,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:16,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478152140] [2025-03-17 05:48:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478152140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:16,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:16,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:48:16,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163762684] [2025-03-17 05:48:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:16,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:16,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:16,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:16,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:48:16,928 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:16,966 INFO L93 Difference]: Finished difference Result 463 states and 675 transitions. [2025-03-17 05:48:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:16,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:48:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:16,968 INFO L225 Difference]: With dead ends: 463 [2025-03-17 05:48:16,968 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 05:48:16,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:16,969 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 86 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:16,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 429 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 05:48:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2025-03-17 05:48:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 203 states have (on average 1.4137931034482758) internal successors, (287), 203 states have internal predecessors, (287), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:48:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2025-03-17 05:48:16,976 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 104 [2025-03-17 05:48:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:16,977 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2025-03-17 05:48:16,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2025-03-17 05:48:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:48:16,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:16,979 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:16,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:48:17,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:17,180 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:17,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:17,180 INFO L85 PathProgramCache]: Analyzing trace with hash -680848223, now seen corresponding path program 1 times [2025-03-17 05:48:17,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:17,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157570991] [2025-03-17 05:48:17,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:17,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:17,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:17,183 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:17,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:48:17,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:48:17,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:48:17,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:17,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:17,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:48:17,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:17,928 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-17 05:48:17,999 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-17 05:48:18,005 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 63 treesize of output 39 [2025-03-17 05:48:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 152 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-17 05:48:18,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:18,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:18,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157570991] [2025-03-17 05:48:18,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157570991] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:18,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:18,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-03-17 05:48:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724354877] [2025-03-17 05:48:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:18,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:48:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:18,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:48:18,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:48:18,168 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:18,841 INFO L93 Difference]: Finished difference Result 589 states and 844 transitions. [2025-03-17 05:48:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:48:18,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:48:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:18,844 INFO L225 Difference]: With dead ends: 589 [2025-03-17 05:48:18,844 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 05:48:18,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:48:18,845 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 77 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:18,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 690 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:48:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 05:48:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 356. [2025-03-17 05:48:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 315 states have (on average 1.3746031746031746) internal successors, (433), 317 states have internal predecessors, (433), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 505 transitions. [2025-03-17 05:48:18,856 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 505 transitions. Word has length 104 [2025-03-17 05:48:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:18,856 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 505 transitions. [2025-03-17 05:48:18,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 505 transitions. [2025-03-17 05:48:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:18,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:18,857 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:18,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 05:48:19,057 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-17 05:48:19,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:19,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:19,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1707799544, now seen corresponding path program 1 times [2025-03-17 05:48:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:19,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041240197] [2025-03-17 05:48:19,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:19,060 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-17 05:48:19,061 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-17 05:48:19,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:19,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:19,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:19,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:19,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:48:19,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:19,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 05:48:19,369 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 24 treesize of output 16 [2025-03-17 05:48:19,384 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 31 treesize of output 19 [2025-03-17 05:48:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:19,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:19,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041240197] [2025-03-17 05:48:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041240197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:19,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:19,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:48:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818213112] [2025-03-17 05:48:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:19,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:48:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:19,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:48:19,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:48:19,437 INFO L87 Difference]: Start difference. First operand 356 states and 505 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:19,709 INFO L93 Difference]: Finished difference Result 678 states and 963 transitions. [2025-03-17 05:48:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:48:19,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:19,712 INFO L225 Difference]: With dead ends: 678 [2025-03-17 05:48:19,712 INFO L226 Difference]: Without dead ends: 481 [2025-03-17 05:48:19,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:48:19,713 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 87 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:19,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1528 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:48:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-17 05:48:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 384. [2025-03-17 05:48:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 343 states have (on average 1.3906705539358601) internal successors, (477), 345 states have internal predecessors, (477), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 549 transitions. [2025-03-17 05:48:19,733 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 549 transitions. Word has length 105 [2025-03-17 05:48:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:19,734 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 549 transitions. [2025-03-17 05:48:19,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 549 transitions. [2025-03-17 05:48:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:19,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:19,734 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:19,743 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-17 05:48:19,935 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-17 05:48:19,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1202240919, now seen corresponding path program 1 times [2025-03-17 05:48:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746482172] [2025-03-17 05:48:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:19,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:19,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:48:20,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:20,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:20,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:20,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:20,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:48:20,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:20,231 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 18 treesize of output 10 [2025-03-17 05:48:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:20,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:20,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746482172] [2025-03-17 05:48:20,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746482172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:20,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:20,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:20,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333625864] [2025-03-17 05:48:20,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:20,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:20,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:20,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:20,245 INFO L87 Difference]: Start difference. First operand 384 states and 549 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:20,423 INFO L93 Difference]: Finished difference Result 692 states and 989 transitions. [2025-03-17 05:48:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:20,425 INFO L225 Difference]: With dead ends: 692 [2025-03-17 05:48:20,425 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 05:48:20,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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-17 05:48:20,426 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 80 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:20,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 805 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:48:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 05:48:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 384. [2025-03-17 05:48:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 343 states have (on average 1.3848396501457727) internal successors, (475), 345 states have internal predecessors, (475), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 547 transitions. [2025-03-17 05:48:20,450 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 547 transitions. Word has length 105 [2025-03-17 05:48:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:20,451 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 547 transitions. [2025-03-17 05:48:20,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 547 transitions. [2025-03-17 05:48:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:20,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:20,452 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:20,460 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-17 05:48:20,653 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-17 05:48:20,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:20,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1640792791, now seen corresponding path program 1 times [2025-03-17 05:48:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567969632] [2025-03-17 05:48:20,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:20,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:20,656 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-17 05:48:20,657 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-17 05:48:20,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:20,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:20,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:20,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:20,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:48:20,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:20,948 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 19 treesize of output 11 [2025-03-17 05:48:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:20,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:20,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:20,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567969632] [2025-03-17 05:48:20,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567969632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:20,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:20,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:20,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093974017] [2025-03-17 05:48:20,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:20,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:20,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:20,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:20,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:20,992 INFO L87 Difference]: Start difference. First operand 384 states and 547 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:21,603 INFO L93 Difference]: Finished difference Result 693 states and 986 transitions. [2025-03-17 05:48:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:21,607 INFO L225 Difference]: With dead ends: 693 [2025-03-17 05:48:21,607 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 05:48:21,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:48:21,608 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 81 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:21,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 781 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:48:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 05:48:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 384. [2025-03-17 05:48:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 343 states have (on average 1.379008746355685) internal successors, (473), 345 states have internal predecessors, (473), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 545 transitions. [2025-03-17 05:48:21,622 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 545 transitions. Word has length 105 [2025-03-17 05:48:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:21,622 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 545 transitions. [2025-03-17 05:48:21,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 545 transitions. [2025-03-17 05:48:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:48:21,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:21,624 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:21,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-03-17 05:48:21,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-17 05:48:21,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:21,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1135234166, now seen corresponding path program 1 times [2025-03-17 05:48:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258059919] [2025-03-17 05:48:21,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:21,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:21,827 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:21,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-17 05:48:21,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:48:22,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:48:22,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:22,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:22,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:48:22,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:22,100 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 12 treesize of output 8 [2025-03-17 05:48:22,116 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-17 05:48:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:22,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:22,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258059919] [2025-03-17 05:48:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258059919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:48:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823983258] [2025-03-17 05:48:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:22,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:48:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:22,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:48:22,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:22,150 INFO L87 Difference]: Start difference. First operand 384 states and 545 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:22,468 INFO L93 Difference]: Finished difference Result 772 states and 1097 transitions. [2025-03-17 05:48:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:48:22,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:48:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:22,471 INFO L225 Difference]: With dead ends: 772 [2025-03-17 05:48:22,471 INFO L226 Difference]: Without dead ends: 547 [2025-03-17 05:48:22,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:48:22,472 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 140 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1809 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:48:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-17 05:48:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 374. [2025-03-17 05:48:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 333 states have (on average 1.3843843843843844) internal successors, (461), 335 states have internal predecessors, (461), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 533 transitions. [2025-03-17 05:48:22,494 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 533 transitions. Word has length 105 [2025-03-17 05:48:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:22,494 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 533 transitions. [2025-03-17 05:48:22,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 533 transitions. [2025-03-17 05:48:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:48:22,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:22,497 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:22,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-17 05:48:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:22,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:22,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:22,698 INFO L85 PathProgramCache]: Analyzing trace with hash 277858029, now seen corresponding path program 1 times [2025-03-17 05:48:22,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:22,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450322907] [2025-03-17 05:48:22,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:22,700 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:22,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-17 05:48:22,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:48:23,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:48:23,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:23,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:23,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:48:23,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:23,247 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-17 05:48:23,304 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-17 05:48:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 05:48:23,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:48:23,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450322907] [2025-03-17 05:48:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450322907] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:23,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-17 05:48:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306259640] [2025-03-17 05:48:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:23,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:48:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:23,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:48:23,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:48:23,441 INFO L87 Difference]: Start difference. First operand 374 states and 533 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:23,523 INFO L93 Difference]: Finished difference Result 431 states and 606 transitions. [2025-03-17 05:48:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:48:23,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-17 05:48:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:23,526 INFO L225 Difference]: With dead ends: 431 [2025-03-17 05:48:23,526 INFO L226 Difference]: Without dead ends: 429 [2025-03-17 05:48:23,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:48:23,528 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 124 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:23,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 817 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-17 05:48:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 428. [2025-03-17 05:48:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 374 states have (on average 1.358288770053476) internal successors, (508), 377 states have internal predecessors, (508), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 05:48:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 600 transitions. [2025-03-17 05:48:23,540 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 600 transitions. Word has length 106 [2025-03-17 05:48:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:23,542 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 600 transitions. [2025-03-17 05:48:23,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:48:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 600 transitions. [2025-03-17 05:48:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:48:23,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:23,543 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:48:23,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-17 05:48:23,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:23,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:23,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 278781550, now seen corresponding path program 1 times [2025-03-17 05:48:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:23,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793362521] [2025-03-17 05:48:23,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:23,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:23,746 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:23,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-17 05:48:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:48:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:48:24,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:24,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:24,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:48:24,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:25,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:48:34,579 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 203 treesize of output 167 [2025-03-17 05:48:34,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:48:34,606 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 267 treesize of output 117 [2025-03-17 05:48:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 05:48:35,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:43,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793362521] [2025-03-17 05:48:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793362521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1996483111] [2025-03-17 05:48:43,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:43,197 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:48:43,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:48:43,199 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-17 05:48:43,201 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-17 05:48:43,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:48:44,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:48:44,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:44,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:44,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:48:44,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:44,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-03-17 05:48:47,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:49:03,206 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 185 treesize of output 149 [2025-03-17 05:49:03,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 121 [2025-03-17 05:49:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 05:49:03,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1996483111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:10,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:49:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-17 05:49:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689556012] [2025-03-17 05:49:10,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:49:10,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:49:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:10,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:49:10,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:49:10,086 INFO L87 Difference]: Start difference. First operand 428 states and 600 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 15 states have internal predecessors, (98), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 05:49:31,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]