./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:14:05,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:14:05,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:14:05,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:14:05,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:14:05,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:14:05,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:14:05,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:14:05,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:14:05,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:14:05,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:14:05,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:14:05,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:14:05,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:14:05,593 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:14:05,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:14:05,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:14:05,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:14:05,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:14:05,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:14:05,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:14:05,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:14:05,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:14:05,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:14:05,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:14:05,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:14:05,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:14:05,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:14:05,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:14:05,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:14:05,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:14:05,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:14:05,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:14:05,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:14:05,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:14:05,596 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2025-03-08 16:14:05,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:14:05,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:14:05,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:14:05,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:14:05,818 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:14:05,819 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-20.i [2025-03-08 16:14:06,934 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dada64605/71a3e38963a74265aa7797751ee8827e/FLAGcaf6a0636 [2025-03-08 16:14:07,163 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:14:07,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2025-03-08 16:14:07,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dada64605/71a3e38963a74265aa7797751ee8827e/FLAGcaf6a0636 [2025-03-08 16:14:07,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dada64605/71a3e38963a74265aa7797751ee8827e [2025-03-08 16:14:07,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:14:07,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:14:07,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:14:07,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:14:07,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:14:07,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07, skipping insertion in model container [2025-03-08 16:14:07,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:14:07,651 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-20.i[916,929] [2025-03-08 16:14:07,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:14:07,722 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:14:07,730 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-20.i[916,929] [2025-03-08 16:14:07,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:14:07,775 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:14:07,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07 WrapperNode [2025-03-08 16:14:07,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:14:07,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:14:07,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:14:07,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:14:07,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,832 INFO L138 Inliner]: procedures = 29, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-08 16:14:07,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:14:07,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:14:07,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:14:07,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:14:07,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,866 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2025-03-08 16:14:07,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:14:07,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:14:07,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:14:07,893 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:14:07,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (1/1) ... [2025-03-08 16:14:07,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:14:07,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:07,928 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-08 16:14:07,931 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-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:14:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:14:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:14:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:14:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:14:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:14:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:14:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:14:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:14:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:14:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:14:08,071 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:14:08,073 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:14:08,435 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem95#1;havoc property_#t~ite103#1;havoc property_#t~mem99#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~short111#1;havoc property_#t~ite122#1;havoc property_#t~mem115#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite139#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short141#1; [2025-03-08 16:14:08,482 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-08 16:14:08,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:14:08,495 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:14:08,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:14:08,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:08 BoogieIcfgContainer [2025-03-08 16:14:08,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:14:08,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:14:08,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:14:08,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:14:08,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:14:07" (1/3) ... [2025-03-08 16:14:08,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504b4c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:08, skipping insertion in model container [2025-03-08 16:14:08,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:07" (2/3) ... [2025-03-08 16:14:08,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504b4c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:08, skipping insertion in model container [2025-03-08 16:14:08,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:08" (3/3) ... [2025-03-08 16:14:08,503 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2025-03-08 16:14:08,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:14:08,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-20.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:14:08,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:14:08,564 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;@9212ef8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:14:08,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:14:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:14:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:14:08,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:08,578 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:08,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:08,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1390539929, now seen corresponding path program 1 times [2025-03-08 16:14:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:08,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620052631] [2025-03-08 16:14:08,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:08,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:08,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:08,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:08,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 16:14:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620052631] [2025-03-08 16:14:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620052631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:14:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420955806] [2025-03-08 16:14:08,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:08,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:08,855 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-08 16:14:08,857 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-08 16:14:09,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:09,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:09,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:09,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:14:09,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 16:14:09,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420955806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:09,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:14:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:14:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034617830] [2025-03-08 16:14:09,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:09,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:14:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:09,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:14:09,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:14:09,141 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:09,163 INFO L93 Difference]: Finished difference Result 218 states and 344 transitions. [2025-03-08 16:14:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:14:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:14:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:09,169 INFO L225 Difference]: With dead ends: 218 [2025-03-08 16:14:09,169 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 16:14:09,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-08 16:14:09,172 INFO L435 NwaCegarLoop]: 156 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, 156 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-08 16:14:09,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 16:14:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-08 16:14:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:14:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-08 16:14:09,199 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 152 [2025-03-08 16:14:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:09,200 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-08 16:14:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-08 16:14:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:14:09,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:09,202 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:09,210 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-08 16:14:09,406 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-08 16:14:09,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:09,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2130099264, now seen corresponding path program 1 times [2025-03-08 16:14:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073140158] [2025-03-08 16:14:09,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:09,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:09,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:09,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:14:10,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073140158] [2025-03-08 16:14:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073140158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466701518] [2025-03-08 16:14:10,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:10,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:10,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:10,208 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:10,335 INFO L93 Difference]: Finished difference Result 260 states and 368 transitions. [2025-03-08 16:14:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:10,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:14:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:10,339 INFO L225 Difference]: With dead ends: 260 [2025-03-08 16:14:10,340 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 16:14:10,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:10,341 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 54 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:10,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 702 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 16:14:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-08 16:14:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:14:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2025-03-08 16:14:10,365 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 152 [2025-03-08 16:14:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:10,365 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2025-03-08 16:14:10,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2025-03-08 16:14:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:14:10,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:10,369 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:10,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:14:10,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:10,370 INFO L85 PathProgramCache]: Analyzing trace with hash 333147905, now seen corresponding path program 1 times [2025-03-08 16:14:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032952901] [2025-03-08 16:14:10,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:10,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:10,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:10,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:10,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:14:10,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:14:10,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:10,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:10,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:10,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:14:10,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:14:10,644 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:14:10,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:14:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:14:10,649 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 16:14:10,728 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:14:10,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:14:10 BoogieIcfgContainer [2025-03-08 16:14:10,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:14:10,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:14:10,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:14:10,733 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:14:10,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:08" (3/4) ... [2025-03-08 16:14:10,736 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:14:10,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:14:10,738 INFO L158 Benchmark]: Toolchain (without parser) took 3216.71ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 60.2MB in the end (delta: 72.7MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2025-03-08 16:14:10,739 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:14:10,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.83ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 117.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:14:10,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.77ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:14:10,741 INFO L158 Benchmark]: Boogie Preprocessor took 59.44ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 109.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:14:10,741 INFO L158 Benchmark]: IcfgBuilder took 603.09ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 77.0MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:14:10,741 INFO L158 Benchmark]: TraceAbstraction took 2235.07ms. Allocated memory is still 167.8MB. Free memory was 76.6MB in the beginning and 60.2MB in the end (delta: 16.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2025-03-08 16:14:10,741 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:14:10,743 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.83ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 117.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.77ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.44ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 109.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 603.09ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 77.0MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2235.07ms. Allocated memory is still 167.8MB. Free memory was 76.6MB in the beginning and 60.2MB in the end (delta: 16.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 60.2MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && 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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] float_Array_0[3] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L90] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L110] RET updateVariables() [L111] CALL step() [L40] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L43] EXPR float_Array_0[2] [L43] EXPR float_Array_0[0] [L43] float_Array_0[4] = (float_Array_0[2] + float_Array_0[0]) [L45] EXPR float_Array_0[2] [L45] EXPR float_Array_0[3] [L45] EXPR double_Array_0[0] [L45] double_Array_0[1] = ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])) [L46] EXPR unsigned_long_int_Array_0[1][0] [L46] unsigned long int stepLocal_2 = unsigned_long_int_Array_0[1][0]; [L47] signed long int stepLocal_1 = 5; [L48] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L48] COND FALSE !(stepLocal_1 >= unsigned_long_int_Array_0[1][1]) [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[1]; [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND TRUE BOOL_unsigned_char_Array_0[0] || stepLocal_0 [L61] EXPR unsigned_long_int_Array_0[1][1] [L61] EXPR unsigned_char_Array_0[1] [L61] EXPR unsigned_char_Array_0[1] [L61] unsigned_long_int_Array_0[0][1] = ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) [L102] EXPR float_Array_0[4] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[0] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) [L102] EXPR double_Array_0[1] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[3] [L102] EXPR double_Array_0[0] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102-L103] return (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 184 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 858 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 556 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 302 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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-08 16:14:10,761 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-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:14:12,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:14:12,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:14:12,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:14:12,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:14:12,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:14:12,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:14:12,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:14:12,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:14:12,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:14:12,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:14:12,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:14:12,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:14:12,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:14:12,829 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:14:12,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:14:12,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:14:12,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:14:12,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:14:12,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:14:12,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:14:12,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:14:12,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:14:12,831 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:14:12,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:14:12,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:14:12,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:14:12,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:14:12,832 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2025-03-08 16:14:13,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:14:13,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:14:13,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:14:13,118 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:14:13,118 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:14:13,119 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-20.i [2025-03-08 16:14:14,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ab6f3ba/6dc140eda2a64bf5a342a5b45cf08b58/FLAGa43d4abd2 [2025-03-08 16:14:14,572 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:14:14,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2025-03-08 16:14:14,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ab6f3ba/6dc140eda2a64bf5a342a5b45cf08b58/FLAGa43d4abd2 [2025-03-08 16:14:14,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ab6f3ba/6dc140eda2a64bf5a342a5b45cf08b58 [2025-03-08 16:14:14,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:14:14,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:14:14,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:14:14,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:14:14,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:14:14,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c46db7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14, skipping insertion in model container [2025-03-08 16:14:14,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:14:14,732 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-20.i[916,929] [2025-03-08 16:14:14,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:14:14,803 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:14:14,810 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-20.i[916,929] [2025-03-08 16:14:14,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:14:14,864 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:14:14,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14 WrapperNode [2025-03-08 16:14:14,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:14:14,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:14:14,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:14:14,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:14:14,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,906 INFO L138 Inliner]: procedures = 36, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-08 16:14:14,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:14:14,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:14:14,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:14:14,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:14:14,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,944 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2025-03-08 16:14:14,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:14,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:14:14,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:14:14,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:14:14,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:14:14,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (1/1) ... [2025-03-08 16:14:15,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:14:15,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:15,023 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-08 16:14:15,033 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-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:14:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:14:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:14:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:14:15,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:14:15,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:14:15,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:14:15,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:14:15,233 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:14:15,235 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:14:24,907 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem95#1;havoc property_#t~ite103#1;havoc property_#t~mem99#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~short111#1;havoc property_#t~ite122#1;havoc property_#t~mem115#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite139#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short141#1; [2025-03-08 16:14:24,941 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-08 16:14:24,942 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:14:24,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:14:24,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:14:24,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:24 BoogieIcfgContainer [2025-03-08 16:14:24,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:14:24,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:14:24,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:14:24,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:14:24,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:14:14" (1/3) ... [2025-03-08 16:14:24,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea384b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:24, skipping insertion in model container [2025-03-08 16:14:24,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:14:14" (2/3) ... [2025-03-08 16:14:24,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea384b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:14:24, skipping insertion in model container [2025-03-08 16:14:24,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:14:24" (3/3) ... [2025-03-08 16:14:24,956 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2025-03-08 16:14:24,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:14:24,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-20.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:14:25,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:14:25,010 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;@66bdbee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:14:25,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:14:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:14:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:14:25,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:25,021 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:25,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:25,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1390539929, now seen corresponding path program 1 times [2025-03-08 16:14:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:25,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892356901] [2025-03-08 16:14:25,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:25,049 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-08 16:14:25,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:25,051 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-08 16:14:25,053 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-08 16:14:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:25,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:25,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:25,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:25,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:14:25,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-08 16:14:25,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:25,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892356901] [2025-03-08 16:14:25,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892356901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:25,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:25,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:14:25,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819594634] [2025-03-08 16:14:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:25,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:14:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:25,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:14:25,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:14:25,871 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:25,890 INFO L93 Difference]: Finished difference Result 218 states and 344 transitions. [2025-03-08 16:14:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:14:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:14:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:25,896 INFO L225 Difference]: With dead ends: 218 [2025-03-08 16:14:25,896 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 16:14:25,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-08 16:14:25,900 INFO L435 NwaCegarLoop]: 156 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, 156 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-08 16:14:25,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 16:14:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-08 16:14:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 16:14:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-08 16:14:25,931 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 152 [2025-03-08 16:14:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:25,932 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-08 16:14:25,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-08 16:14:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:14:25,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:25,934 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:25,955 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-08 16:14:26,135 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-08 16:14:26,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2130099264, now seen corresponding path program 1 times [2025-03-08 16:14:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163799327] [2025-03-08 16:14:26,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:26,137 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-08 16:14:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:26,140 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-08 16:14:26,141 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-08 16:14:26,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:26,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:26,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:26,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:26,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:14:26,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 204 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 16:14:28,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:14:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-08 16:14:28,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163799327] [2025-03-08 16:14:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163799327] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:14:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:14:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-08 16:14:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112113828] [2025-03-08 16:14:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:28,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:14:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:28,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:14:28,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:14:28,578 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:14:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:29,560 INFO L93 Difference]: Finished difference Result 260 states and 368 transitions. [2025-03-08 16:14:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:14:29,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-08 16:14:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:29,563 INFO L225 Difference]: With dead ends: 260 [2025-03-08 16:14:29,564 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 16:14:29,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:14:29,565 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 104 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:29,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 431 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:14:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 16:14:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-08 16:14:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:14:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2025-03-08 16:14:29,586 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 152 [2025-03-08 16:14:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:29,586 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2025-03-08 16:14:29,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 16:14:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2025-03-08 16:14:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:14:29,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:29,588 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:29,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:14:29,788 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-08 16:14:29,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:29,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash 333147905, now seen corresponding path program 1 times [2025-03-08 16:14:29,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:29,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186806552] [2025-03-08 16:14:29,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:29,790 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-08 16:14:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:29,793 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-08 16:14:29,794 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-08 16:14:29,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:14:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:14:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:30,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:14:30,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:30,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:14:30,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-08 16:14:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-08 16:14:30,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:30,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186806552] [2025-03-08 16:14:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186806552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349815818] [2025-03-08 16:14:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:30,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:30,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:30,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:30,844 INFO L87 Difference]: Start difference. First operand 151 states and 212 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:36,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:38,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:42,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:45,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:45,996 INFO L93 Difference]: Finished difference Result 300 states and 422 transitions. [2025-03-08 16:14:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:14:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 16:14:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:46,003 INFO L225 Difference]: With dead ends: 300 [2025-03-08 16:14:46,004 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 16:14:46,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:46,006 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 136 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:46,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 452 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 1 Unknown, 0 Unchecked, 15.0s Time] [2025-03-08 16:14:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 16:14:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-03-08 16:14:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.330708661417323) internal successors, (169), 128 states have internal predecessors, (169), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:14:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 211 transitions. [2025-03-08 16:14:46,018 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 211 transitions. Word has length 152 [2025-03-08 16:14:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:46,018 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 211 transitions. [2025-03-08 16:14:46,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 211 transitions. [2025-03-08 16:14:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:14:46,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:46,023 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:46,045 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-08 16:14:46,223 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-08 16:14:46,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:46,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -804330401, now seen corresponding path program 1 times [2025-03-08 16:14:46,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:14:46,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071532004] [2025-03-08 16:14:46,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:46,225 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-08 16:14:46,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:14:46,227 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-08 16:14:46,230 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-08 16:14:46,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:14:46,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:14:46,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:46,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:46,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:14:46,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:47,398 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 95 treesize of output 41 [2025-03-08 16:14:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-08 16:14:47,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:47,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:14:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071532004] [2025-03-08 16:14:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071532004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:14:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596628085] [2025-03-08 16:14:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:47,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:14:47,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:47,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:47,483 INFO L87 Difference]: Start difference. First operand 151 states and 211 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:14:52,741 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-08 16:14:55,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:14:57,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:15:01,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:15:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:01,891 INFO L93 Difference]: Finished difference Result 300 states and 420 transitions. [2025-03-08 16:15:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:15:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-08 16:15:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:01,902 INFO L225 Difference]: With dead ends: 300 [2025-03-08 16:15:01,902 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 16:15:01,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:15:01,904 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 120 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:01,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 443 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 14.3s Time] [2025-03-08 16:15:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 16:15:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-03-08 16:15:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 128 states have internal predecessors, (168), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:15:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 210 transitions. [2025-03-08 16:15:01,925 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 210 transitions. Word has length 154 [2025-03-08 16:15:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:01,925 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 210 transitions. [2025-03-08 16:15:01,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:15:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2025-03-08 16:15:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 16:15:01,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:01,928 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:15:01,950 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-08 16:15:02,128 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-08 16:15:02,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash -437226435, now seen corresponding path program 1 times [2025-03-08 16:15:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80781978] [2025-03-08 16:15:02,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:02,130 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-08 16:15:02,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:02,131 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-08 16:15:02,132 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-08 16:15:02,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:15:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:15:02,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:02,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:02,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:15:02,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:03,308 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 95 treesize of output 41 [2025-03-08 16:15:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-03-08 16:15:03,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:03,395 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:15:03,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80781978] [2025-03-08 16:15:03,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80781978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:03,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:15:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622523502] [2025-03-08 16:15:03,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:03,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:15:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:15:03,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:15:03,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:03,397 INFO L87 Difference]: Start difference. First operand 151 states and 210 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:15:07,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:15:12,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:15:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:13,254 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2025-03-08 16:15:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:15:13,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2025-03-08 16:15:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:13,259 INFO L225 Difference]: With dead ends: 300 [2025-03-08 16:15:13,259 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 16:15:13,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:15:13,260 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 112 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:13,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 441 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2025-03-08 16:15:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 16:15:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-03-08 16:15:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.31496062992126) internal successors, (167), 128 states have internal predecessors, (167), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:15:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 209 transitions. [2025-03-08 16:15:13,268 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 209 transitions. Word has length 156 [2025-03-08 16:15:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:13,268 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 209 transitions. [2025-03-08 16:15:13,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:15:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 209 transitions. [2025-03-08 16:15:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:15:13,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:13,269 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:15:13,292 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-08 16:15:13,470 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-08 16:15:13,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:13,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 389128927, now seen corresponding path program 1 times [2025-03-08 16:15:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779242835] [2025-03-08 16:15:13,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:13,471 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-08 16:15:13,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:13,473 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-08 16:15:13,474 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-08 16:15:13,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:15:14,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:15:14,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:15:14,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:15:14,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:15:14,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:15:14,696 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 97 treesize of output 43 [2025-03-08 16:15:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-08 16:15:14,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:15:14,754 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:15:14,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779242835] [2025-03-08 16:15:14,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779242835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:15:14,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:15:14,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:15:14,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025270443] [2025-03-08 16:15:14,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:15:14,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:15:14,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:15:14,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:15:14,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:15:14,755 INFO L87 Difference]: Start difference. First operand 151 states and 209 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:15:20,005 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-08 16:15:23,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:15:27,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:15:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:15:27,796 INFO L93 Difference]: Finished difference Result 300 states and 416 transitions. [2025-03-08 16:15:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:15:27,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-03-08 16:15:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:15:27,803 INFO L225 Difference]: With dead ends: 300 [2025-03-08 16:15:27,803 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 16:15:27,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:15:27,803 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 103 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:15:27,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 435 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 13.0s Time] [2025-03-08 16:15:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 16:15:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-03-08 16:15:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 128 states have internal predecessors, (166), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:15:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 208 transitions. [2025-03-08 16:15:27,813 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 208 transitions. Word has length 158 [2025-03-08 16:15:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:15:27,813 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 208 transitions. [2025-03-08 16:15:27,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 16:15:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 208 transitions. [2025-03-08 16:15:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:15:27,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:15:27,815 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:15:27,838 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-08 16:15:28,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:28,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:15:28,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:15:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 735620285, now seen corresponding path program 1 times [2025-03-08 16:15:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:15:28,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736872970] [2025-03-08 16:15:28,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:15:28,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:15:28,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:15:28,018 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:15:28,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 16:15:28,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.