./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.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-a_file-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:21:41,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:21:41,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:21:41,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:21:41,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:21:41,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:21:41,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:21:41,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:21:41,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:21:41,516 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:21:41,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:21:41,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:21:41,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:21:41,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:21:41,517 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:21:41,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:21:41,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:21:41,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:41,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:21:41,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:21:41,519 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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2025-03-17 05:21:41,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:21:41,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:21:41,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:21:41,794 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:21:41,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:21:41,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2025-03-17 05:21:42,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8657b3fc/7e955a7bd95749aaaa588bb1f81ed266/FLAG7b9ef31ff [2025-03-17 05:21:43,248 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:21:43,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2025-03-17 05:21:43,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8657b3fc/7e955a7bd95749aaaa588bb1f81ed266/FLAG7b9ef31ff [2025-03-17 05:21:43,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8657b3fc/7e955a7bd95749aaaa588bb1f81ed266 [2025-03-17 05:21:43,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:21:43,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:21:43,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:43,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:21:43,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:21:43,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e8459e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43, skipping insertion in model container [2025-03-17 05:21:43,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:21:43,706 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-a_file-29.i[916,929] [2025-03-17 05:21:43,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:43,759 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:21:43,766 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-a_file-29.i[916,929] [2025-03-17 05:21:43,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:43,812 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:21:43,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43 WrapperNode [2025-03-17 05:21:43,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:43,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:43,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:21:43,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:21:43,817 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:21:43" (1/1) ... [2025-03-17 05:21:43,825 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:21:43" (1/1) ... [2025-03-17 05:21:43,857 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-03-17 05:21:43,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:43,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:21:43,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:21:43,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:21:43,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,890 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2025-03-17 05:21:43,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:21:43,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:21:43,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:21:43,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:21:43,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (1/1) ... [2025-03-17 05:21:43,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:43,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:43,935 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:21:43,939 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:21:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:21:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:21:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:21:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:21:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:21:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:21:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:21:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:21:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:21:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:21:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:21:43,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:21:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:21:43,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:21:44,067 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:21:44,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:21:44,353 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-03-17 05:21:44,386 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-17 05:21:44,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:21:44,394 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:21:44,395 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:21:44,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:44 BoogieIcfgContainer [2025-03-17 05:21:44,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:21:44,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:21:44,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:21:44,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:21:44,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:21:43" (1/3) ... [2025-03-17 05:21:44,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c30c34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:44, skipping insertion in model container [2025-03-17 05:21:44,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:43" (2/3) ... [2025-03-17 05:21:44,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c30c34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:44, skipping insertion in model container [2025-03-17 05:21:44,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:44" (3/3) ... [2025-03-17 05:21:44,402 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2025-03-17 05:21:44,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:21:44,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-29.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:21:44,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:21:44,461 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;@3547a959, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:21:44,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:21:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:21:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:21:44,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:44,470 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:44,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2127226037, now seen corresponding path program 1 times [2025-03-17 05:21:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:44,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563924243] [2025-03-17 05:21:44,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:44,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:44,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:21:44,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:21:44,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:44,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 05:21:44,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:44,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563924243] [2025-03-17 05:21:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563924243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032981823] [2025-03-17 05:21:44,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:44,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:44,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:44,694 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:21:44,696 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:21:44,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:21:44,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:21:44,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:44,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:44,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:21:44,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 05:21:44,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032981823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:44,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:44,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:21:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151165048] [2025-03-17 05:21:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:44,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:21:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:44,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:21:44,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:44,902 INFO L87 Difference]: Start difference. First operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 05:21:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:44,933 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2025-03-17 05:21:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:21:44,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-03-17 05:21:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:44,941 INFO L225 Difference]: With dead ends: 161 [2025-03-17 05:21:44,941 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:21:44,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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:21:44,947 INFO L435 NwaCegarLoop]: 116 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, 116 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:21:44,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:21:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 05:21:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:21:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-03-17 05:21:44,972 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 69 [2025-03-17 05:21:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:44,973 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-03-17 05:21:44,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 05:21:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-03-17 05:21:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:21:44,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:44,975 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,981 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:21:45,175 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:21:45,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -340615463, now seen corresponding path program 1 times [2025-03-17 05:21:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402187623] [2025-03-17 05:21:45,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:45,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:21:45,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:21:45,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 05:21:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:45,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402187623] [2025-03-17 05:21:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402187623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:45,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:45,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:21:45,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956715902] [2025-03-17 05:21:45,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:45,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:21:45,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:45,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:21:45,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:45,410 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:21:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:45,450 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2025-03-17 05:21:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:21:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 05:21:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:45,452 INFO L225 Difference]: With dead ends: 162 [2025-03-17 05:21:45,452 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:21:45,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:45,453 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 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:21:45,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:21:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 05:21:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:21:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-03-17 05:21:45,468 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 69 [2025-03-17 05:21:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:45,470 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-03-17 05:21:45,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:21:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-03-17 05:21:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:21:45,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:45,472 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:45,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:21:45,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 546888218, now seen corresponding path program 1 times [2025-03-17 05:21:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182543894] [2025-03-17 05:21:45,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:45,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:21:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:21:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:45,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 05:21:45,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182543894] [2025-03-17 05:21:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182543894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:21:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886193099] [2025-03-17 05:21:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:45,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:21:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:45,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:21:45,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:45,645 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:21:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:45,676 INFO L93 Difference]: Finished difference Result 166 states and 239 transitions. [2025-03-17 05:21:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:21:45,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 05:21:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:45,678 INFO L225 Difference]: With dead ends: 166 [2025-03-17 05:21:45,678 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 05:21:45,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:45,679 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 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:21:45,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 05:21:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-17 05:21:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:21:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-17 05:21:45,688 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 69 [2025-03-17 05:21:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:45,688 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-17 05:21:45,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:21:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-17 05:21:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:21:45,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:45,691 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:45,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:21:45,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:45,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 547811739, now seen corresponding path program 1 times [2025-03-17 05:21:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:45,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202501313] [2025-03-17 05:21:45,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:45,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:21:45,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:21:45,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:45,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:21:45,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:21:45,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:21:45,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:21:45,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:45,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:21:45,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:21:45,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:21:45,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:21:45,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:21:45,838 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 05:21:45,885 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:21:45,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:21:45 BoogieIcfgContainer [2025-03-17 05:21:45,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:21:45,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:21:45,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:21:45,888 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:21:45,888 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:44" (3/4) ... [2025-03-17 05:21:45,890 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:21:45,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:21:45,891 INFO L158 Benchmark]: Toolchain (without parser) took 2315.80ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 73.2MB in the end (delta: 39.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2025-03-17 05:21:45,891 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:45,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.79ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 98.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:21:45,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.84ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:45,892 INFO L158 Benchmark]: Boogie Preprocessor took 50.02ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:45,892 INFO L158 Benchmark]: IcfgBuilder took 486.86ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 62.3MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:21:45,892 INFO L158 Benchmark]: TraceAbstraction took 1490.71ms. Allocated memory is still 142.6MB. Free memory was 61.4MB in the beginning and 74.0MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:45,892 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 73.2MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:45,893 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.34ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.79ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 98.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.84ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.02ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 486.86ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 62.3MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1490.71ms. Allocated memory is still 142.6MB. Free memory was 61.4MB in the beginning and 74.0MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 73.2MB in the end (delta: 21.0kB). 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 68, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] float_Array_0[0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] float_Array_0[1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET updateVariables() [L87] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1] [L37] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L38] EXPR unsigned_char_Array_0[1] [L38] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L39] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND TRUE BOOL_unsigned_char_Array_0[0] [L40] EXPR float_Array_0[1] [L40] float_Array_0[2] = float_Array_0[1] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L46] COND FALSE !((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) [L49] EXPR unsigned_char_Array_0[2] [L49] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] [L51] signed long int stepLocal_0 = 5 * unsigned_char_Array_0[2]; [L52] EXPR float_Array_0[1] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) [L52] EXPR float_Array_0[1] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=0, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] COND FALSE !(((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) [L59] EXPR float_Array_0[2] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] COND TRUE float_Array_0[2] < float_Array_0[1] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L87] RET step() [L88] CALL, EXPR property() [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) [L78] EXPR float_Array_0[2] [L78] EXPR float_Array_0[1] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78-L79] return (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 775 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 342 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 230/240 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:21:45,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:21:47,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:21:48,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:21:48,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:21:48,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:21:48,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:21:48,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:21:48,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:21:48,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:21:48,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:21:48,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:21:48,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:21:48,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:21:48,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:21:48,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:21:48,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:21:48,041 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:21:48,041 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:21:48,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:21:48,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:21:48,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:21:48,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:21:48,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:21:48,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:21:48,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:21:48,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:21:48,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:48,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:21:48,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:21:48,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:21:48,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:21:48,044 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:21:48,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:21:48,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:21:48,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:21:48,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:21:48,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:21:48,044 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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2025-03-17 05:21:48,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:21:48,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:21:48,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:21:48,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:21:48,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:21:48,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2025-03-17 05:21:49,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef1a87e1/be0c2d28275f4b6eaf711e699dc15a27/FLAGd6e9494e9 [2025-03-17 05:21:49,728 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:21:49,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2025-03-17 05:21:49,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef1a87e1/be0c2d28275f4b6eaf711e699dc15a27/FLAGd6e9494e9 [2025-03-17 05:21:49,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef1a87e1/be0c2d28275f4b6eaf711e699dc15a27 [2025-03-17 05:21:49,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:21:49,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:21:49,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:49,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:21:49,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:21:49,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:49,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc4cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49, skipping insertion in model container [2025-03-17 05:21:49,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:49,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:21:49,872 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-a_file-29.i[916,929] [2025-03-17 05:21:49,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:49,946 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:21:49,954 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-a_file-29.i[916,929] [2025-03-17 05:21:49,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:49,997 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:21:49,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49 WrapperNode [2025-03-17 05:21:49,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:50,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:50,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:21:50,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:21:50,006 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:21:49" (1/1) ... [2025-03-17 05:21:50,019 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:21:49" (1/1) ... [2025-03-17 05:21:50,060 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-03-17 05:21:50,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:50,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:21:50,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:21:50,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:21:50,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,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:21:49" (1/1) ... [2025-03-17 05:21:50,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,102 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2025-03-17 05:21:50,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:21:50,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:21:50,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:21:50,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:21:50,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (1/1) ... [2025-03-17 05:21:50,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:50,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:50,180 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:21:50,183 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:21:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:21:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:21:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:21:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:21:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:21:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:21:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:21:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:21:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:21:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:21:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:21:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:21:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:21:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:21:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:21:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:21:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:21:50,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:21:50,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:21:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:21:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:21:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:21:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:21:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:21:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:21:50,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:21:50,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:21:58,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-03-17 05:21:58,918 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-17 05:21:58,919 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:21:58,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:21:58,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:21:58,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:58 BoogieIcfgContainer [2025-03-17 05:21:58,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:21:58,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:21:58,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:21:58,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:21:58,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:21:49" (1/3) ... [2025-03-17 05:21:58,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6082c3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:58, skipping insertion in model container [2025-03-17 05:21:58,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:49" (2/3) ... [2025-03-17 05:21:58,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6082c3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:58, skipping insertion in model container [2025-03-17 05:21:58,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:58" (3/3) ... [2025-03-17 05:21:58,937 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2025-03-17 05:21:58,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:21:58,951 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-29.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:21:58,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:21:59,000 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;@2432231f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:21:59,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:21:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:21:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:21:59,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:59,011 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:59,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:59,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2127226037, now seen corresponding path program 1 times [2025-03-17 05:21:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:59,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530196782] [2025-03-17 05:21:59,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:59,026 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:21:59,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:59,032 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:21:59,033 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:21:59,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:21:59,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:21:59,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:59,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:59,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:21:59,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 05:21:59,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:59,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:59,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530196782] [2025-03-17 05:21:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530196782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:21:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104258569] [2025-03-17 05:21:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:59,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:21:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:59,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:21:59,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:59,462 INFO L87 Difference]: Start difference. First operand has 82 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 05:21:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:59,484 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2025-03-17 05:21:59,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:21:59,486 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-03-17 05:21:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:59,491 INFO L225 Difference]: With dead ends: 161 [2025-03-17 05:21:59,492 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:21:59,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:21:59,498 INFO L435 NwaCegarLoop]: 116 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, 116 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:21:59,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:21:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 05:21:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:21:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-03-17 05:21:59,536 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 69 [2025-03-17 05:21:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:59,537 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-03-17 05:21:59,537 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 05:21:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-03-17 05:21:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:21:59,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:59,541 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,552 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:21:59,741 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:21:59,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash -340615463, now seen corresponding path program 1 times [2025-03-17 05:21:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667664996] [2025-03-17 05:21:59,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:59,744 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:21:59,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:59,746 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:21:59,748 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:21:59,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:22:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:22:00,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:00,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:00,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:22:00,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 05:22:00,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:00,150 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667664996] [2025-03-17 05:22:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667664996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793494967] [2025-03-17 05:22:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:00,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:00,153 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:00,314 INFO L93 Difference]: Finished difference Result 166 states and 241 transitions. [2025-03-17 05:22:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:00,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 05:22:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:00,316 INFO L225 Difference]: With dead ends: 166 [2025-03-17 05:22:00,316 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:22:00,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:00,317 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:00,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 524 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:22:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-17 05:22:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:22:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-03-17 05:22:00,323 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 69 [2025-03-17 05:22:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:00,325 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-03-17 05:22:00,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-03-17 05:22:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:22:00,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:00,326 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:00,339 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:22:00,527 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:22:00,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:00,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 546888218, now seen corresponding path program 1 times [2025-03-17 05:22:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:00,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168071799] [2025-03-17 05:22:00,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:00,529 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:22:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:00,534 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:22:00,535 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:22:00,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:22:00,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:22:00,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:00,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:00,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:22:00,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 05:22:00,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:00,915 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168071799] [2025-03-17 05:22:00,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168071799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:00,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:22:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099616175] [2025-03-17 05:22:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:00,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:22:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:00,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:22:00,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:00,917 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:01,021 INFO L93 Difference]: Finished difference Result 174 states and 247 transitions. [2025-03-17 05:22:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:01,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 05:22:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:01,022 INFO L225 Difference]: With dead ends: 174 [2025-03-17 05:22:01,022 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 05:22:01,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:01,023 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:01,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 622 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 05:22:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-03-17 05:22:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 05:22:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2025-03-17 05:22:01,033 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 69 [2025-03-17 05:22:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:01,036 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2025-03-17 05:22:01,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2025-03-17 05:22:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:22:01,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:01,037 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:01,046 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:22:01,237 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:22:01,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:01,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 547811739, now seen corresponding path program 1 times [2025-03-17 05:22:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:01,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408372105] [2025-03-17 05:22:01,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:01,239 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:22:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:01,241 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:22:01,241 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:22:01,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:22:01,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:22:01,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:01,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:01,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:22:01,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:02,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 67 [2025-03-17 05:22:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 05:22:02,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 05:22:03,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408372105] [2025-03-17 05:22:03,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408372105] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:03,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:03,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-17 05:22:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227702918] [2025-03-17 05:22:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:03,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:03,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:03,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:03,023 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:03,736 INFO L93 Difference]: Finished difference Result 247 states and 346 transitions. [2025-03-17 05:22:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:03,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 05:22:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:03,739 INFO L225 Difference]: With dead ends: 247 [2025-03-17 05:22:03,739 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 05:22:03,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:22:03,741 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 85 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:03,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 381 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:22:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 05:22:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2025-03-17 05:22:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 145 states have (on average 1.393103448275862) internal successors, (202), 146 states have internal predecessors, (202), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 220 transitions. [2025-03-17 05:22:03,751 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 220 transitions. Word has length 69 [2025-03-17 05:22:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:03,752 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 220 transitions. [2025-03-17 05:22:03,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 220 transitions. [2025-03-17 05:22:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:22:03,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:03,753 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:03,763 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:22:03,953 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:22:03,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:03,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1901121436, now seen corresponding path program 1 times [2025-03-17 05:22:03,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:03,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841440445] [2025-03-17 05:22:03,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:03,955 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:22:03,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:03,957 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:22:03,958 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:22:04,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:22:04,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:22:04,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:04,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:04,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:22:04,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:04,410 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 8 treesize of output 1 [2025-03-17 05:22:05,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 67 [2025-03-17 05:22:05,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:05,160 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 166 treesize of output 58 [2025-03-17 05:22:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 05:22:05,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 05:22:05,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841440445] [2025-03-17 05:22:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841440445] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:05,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-17 05:22:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826071421] [2025-03-17 05:22:05,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:05,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:05,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:05,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:22:05,560 INFO L87 Difference]: Start difference. First operand 157 states and 220 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:06,222 INFO L93 Difference]: Finished difference Result 394 states and 548 transitions. [2025-03-17 05:22:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:06,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2025-03-17 05:22:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:06,226 INFO L225 Difference]: With dead ends: 394 [2025-03-17 05:22:06,226 INFO L226 Difference]: Without dead ends: 238 [2025-03-17 05:22:06,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:06,228 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 85 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:06,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 263 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:22:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-17 05:22:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2025-03-17 05:22:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 146 states have internal predecessors, (201), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 219 transitions. [2025-03-17 05:22:06,241 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 219 transitions. Word has length 69 [2025-03-17 05:22:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:06,242 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 219 transitions. [2025-03-17 05:22:06,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 219 transitions. [2025-03-17 05:22:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:22:06,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:06,243 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:06,253 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:22:06,444 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:22:06,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:06,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2112472349, now seen corresponding path program 1 times [2025-03-17 05:22:06,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:06,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788599113] [2025-03-17 05:22:06,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:06,445 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:22:06,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:06,451 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:22:06,464 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:22:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:22:06,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:22:06,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:06,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:06,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:22:06,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:07,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 67 [2025-03-17 05:22:07,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:07,728 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 166 treesize of output 58 [2025-03-17 05:22:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 05:22:07,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:08,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788599113] [2025-03-17 05:22:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788599113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1381711093] [2025-03-17 05:22:08,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:08,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:22:08,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:22:08,128 INFO L229 MonitoredProcess]: Starting monitored process 8 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:22:08,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-17 05:22:08,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:22:08,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:22:08,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:08,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:08,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:22:08,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:09,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 101 treesize of output 55 [2025-03-17 05:22:09,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:09,601 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 136 treesize of output 46 [2025-03-17 05:22:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 05:22:09,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1381711093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:09,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:22:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-17 05:22:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794363732] [2025-03-17 05:22:09,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:09,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:22:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:09,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:22:09,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:22:09,883 INFO L87 Difference]: Start difference. First operand 157 states and 219 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 05:22:12,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:16,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:18,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:23,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:26,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:28,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:32,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:35,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:38,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:22:41,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:45,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:47,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:50,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:51,332 INFO L93 Difference]: Finished difference Result 532 states and 739 transitions. [2025-03-17 05:22:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 69 [2025-03-17 05:22:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:51,334 INFO L225 Difference]: With dead ends: 532 [2025-03-17 05:22:51,334 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 05:22:51,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:22:51,335 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 361 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:51,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1118 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 841 Invalid, 1 Unknown, 0 Unchecked, 40.9s Time] [2025-03-17 05:22:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 05:22:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 246. [2025-03-17 05:22:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 227 states have (on average 1.3876651982378854) internal successors, (315), 229 states have internal predecessors, (315), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:22:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 345 transitions. [2025-03-17 05:22:51,352 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 345 transitions. Word has length 69 [2025-03-17 05:22:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:51,352 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 345 transitions. [2025-03-17 05:22:51,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 05:22:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 345 transitions. [2025-03-17 05:22:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:22:51,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:51,353 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:51,365 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:22:51,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:22:51,754 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:22:51,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:51,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash 929125052, now seen corresponding path program 1 times [2025-03-17 05:22:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888492465] [2025-03-17 05:22:51,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:51,755 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:22:51,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:51,757 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:22:51,757 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:22:51,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:22:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:22:51,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:51,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:51,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:22:51,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 05:22:52,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:52,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:52,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888492465] [2025-03-17 05:22:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888492465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:52,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:52,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653325526] [2025-03-17 05:22:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:52,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:52,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:52,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:52,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:52,018 INFO L87 Difference]: Start difference. First operand 246 states and 345 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 05:22:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:52,094 INFO L93 Difference]: Finished difference Result 491 states and 689 transitions. [2025-03-17 05:22:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-03-17 05:22:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:52,096 INFO L225 Difference]: With dead ends: 491 [2025-03-17 05:22:52,096 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 05:22:52,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 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:22:52,097 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:52,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 05:22:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-17 05:22:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 227 states have (on average 1.3832599118942732) internal successors, (314), 229 states have internal predecessors, (314), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:22:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 344 transitions. [2025-03-17 05:22:52,106 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 344 transitions. Word has length 69 [2025-03-17 05:22:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:52,106 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 344 transitions. [2025-03-17 05:22:52,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 05:22:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 344 transitions. [2025-03-17 05:22:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 05:22:52,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:52,107 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:52,116 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:22:52,307 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:22:52,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:52,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:52,308 INFO L85 PathProgramCache]: Analyzing trace with hash 450497093, now seen corresponding path program 1 times [2025-03-17 05:22:52,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:52,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428950340] [2025-03-17 05:22:52,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:52,308 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:22:52,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:52,312 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:22:52,313 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:22:52,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 05:22:52,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 05:22:52,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:52,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:52,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:22:52,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:53,212 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 35 treesize of output 17 [2025-03-17 05:22:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 05:22:53,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 05:22:53,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:53,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428950340] [2025-03-17 05:22:53,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428950340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:22:53,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:22:53,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2025-03-17 05:22:53,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066526071] [2025-03-17 05:22:53,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:53,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:22:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:53,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:22:53,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:22:53,884 INFO L87 Difference]: Start difference. First operand 246 states and 344 transitions. Second operand has 16 states, 12 states have (on average 5.75) internal successors, (69), 16 states have internal predecessors, (69), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:22:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:54,635 INFO L93 Difference]: Finished difference Result 367 states and 499 transitions. [2025-03-17 05:22:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:54,636 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 5.75) internal successors, (69), 16 states have internal predecessors, (69), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 70 [2025-03-17 05:22:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:54,636 INFO L225 Difference]: With dead ends: 367 [2025-03-17 05:22:54,636 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:22:54,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:22:54,637 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:54,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 561 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:22:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-03-17 05:22:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 103 states have internal predecessors, (132), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2025-03-17 05:22:54,646 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 70 [2025-03-17 05:22:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:54,646 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2025-03-17 05:22:54,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 5.75) internal successors, (69), 16 states have internal predecessors, (69), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:22:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2025-03-17 05:22:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 05:22:54,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:54,648 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:54,657 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:22:54,848 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:22:54,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1980785663, now seen corresponding path program 1 times [2025-03-17 05:22:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369404756] [2025-03-17 05:22:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:54,849 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:22:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:54,854 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:22:54,857 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:22:54,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 05:22:55,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 05:22:55,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:55,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:55,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:22:55,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:55,307 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 1 [2025-03-17 05:22:55,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 67 [2025-03-17 05:22:56,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:56,501 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 224 treesize of output 80 [2025-03-17 05:22:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 05:22:56,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 05:22:58,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369404756] [2025-03-17 05:22:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369404756] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:58,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:58,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2025-03-17 05:22:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052218126] [2025-03-17 05:22:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:58,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:22:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:58,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:22:58,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:22:58,142 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:59,851 INFO L93 Difference]: Finished difference Result 331 states and 417 transitions. [2025-03-17 05:22:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:59,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 70 [2025-03-17 05:22:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:59,853 INFO L225 Difference]: With dead ends: 331 [2025-03-17 05:22:59,853 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 05:22:59,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:22:59,854 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 227 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:59,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 555 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:22:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 05:22:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 124. [2025-03-17 05:22:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.275229357798165) internal successors, (139), 109 states have internal predecessors, (139), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2025-03-17 05:22:59,861 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 70 [2025-03-17 05:22:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:59,862 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2025-03-17 05:22:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 05:22:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2025-03-17 05:22:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 05:22:59,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:59,862 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:59,872 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:23:00,063 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:23:00,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1414326497, now seen corresponding path program 1 times [2025-03-17 05:23:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426109162] [2025-03-17 05:23:00,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:00,064 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:23:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:00,066 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:23:00,066 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:23:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 05:23:00,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 05:23:00,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:00,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:00,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:23:00,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:01,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 65 [2025-03-17 05:23:01,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:01,356 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 164 treesize of output 56 [2025-03-17 05:23:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 05:23:01,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:01,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426109162] [2025-03-17 05:23:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426109162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2113009376] [2025-03-17 05:23:01,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:01,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:23:01,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-17 05:23:02,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 05:23:02,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 05:23:02,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:02,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:02,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:23:02,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:03,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 46 [2025-03-17 05:23:04,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:04,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 45 [2025-03-17 05:23:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 05:23:04,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2113009376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:04,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2025-03-17 05:23:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889992818] [2025-03-17 05:23:04,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:23:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:04,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:23:04,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:23:04,748 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 23 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 6 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:23:09,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:23:14,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:23:19,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:23:22,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []