./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.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-74.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 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:21:01,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:21:01,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:21:01,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:21:01,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:21:01,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:21:01,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:21:01,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:21:01,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:21:01,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:21:01,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:21:01,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:21:01,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:21:01,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:21:01,520 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:21:01,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:21:01,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:21:01,521 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:21:01,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:21:01,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:21:01,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:21:01,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:21:01,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:01,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:21:01,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:21:01,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:21:01,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:21:01,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:21:01,524 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 -> 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 [2025-03-08 16:21:01,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:21:01,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:21:01,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:21:01,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:21:01,762 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:21:01,764 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-74.i [2025-03-08 16:21:02,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14e0ffdc/cffa265766b7417487dcedff0bdced17/FLAG44b817d62 [2025-03-08 16:21:03,108 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:21:03,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2025-03-08 16:21:03,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14e0ffdc/cffa265766b7417487dcedff0bdced17/FLAG44b817d62 [2025-03-08 16:21:03,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14e0ffdc/cffa265766b7417487dcedff0bdced17 [2025-03-08 16:21:03,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:21:03,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:21:03,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:03,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:21:03,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:21:03,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e27fb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03, skipping insertion in model container [2025-03-08 16:21:03,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:21:03,571 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-74.i[916,929] [2025-03-08 16:21:03,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:03,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:21:03,661 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-74.i[916,929] [2025-03-08 16:21:03,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:03,723 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:21:03,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03 WrapperNode [2025-03-08 16:21:03,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:03,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:03,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:21:03,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:21:03,731 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:21:03" (1/1) ... [2025-03-08 16:21:03,741 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:21:03" (1/1) ... [2025-03-08 16:21:03,770 INFO L138 Inliner]: procedures = 29, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 577 [2025-03-08 16:21:03,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:03,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:21:03,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:21:03,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:21:03,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,811 INFO L175 MemorySlicer]: Split 152 memory accesses to 4 slices as follows [2, 37, 70, 43]. 46 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 20 writes are split as follows [0, 7, 5, 8]. [2025-03-08 16:21:03,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:21:03,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:21:03,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:21:03,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:21:03,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (1/1) ... [2025-03-08 16:21:03,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:03,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:03,878 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:21:03,880 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:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:21:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:21:03,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:21:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:21:03,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:21:03,986 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:21:03,987 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:21:04,315 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite141#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite150#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1;havoc property_#t~short151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short154#1;havoc property_#t~ite164#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~ite161#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short165#1; [2025-03-08 16:21:04,345 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-03-08 16:21:04,345 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:21:04,354 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:21:04,354 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:21:04,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:04 BoogieIcfgContainer [2025-03-08 16:21:04,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:21:04,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:21:04,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:21:04,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:21:04,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:21:03" (1/3) ... [2025-03-08 16:21:04,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890a638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:04, skipping insertion in model container [2025-03-08 16:21:04,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:03" (2/3) ... [2025-03-08 16:21:04,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890a638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:04, skipping insertion in model container [2025-03-08 16:21:04,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:04" (3/3) ... [2025-03-08 16:21:04,365 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-74.i [2025-03-08 16:21:04,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:21:04,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-74.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:21:04,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:21:04,438 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;@26da9462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:21:04,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:21:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:04,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:04,456 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:04,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:04,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash -510266714, now seen corresponding path program 1 times [2025-03-08 16:21:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821559736] [2025-03-08 16:21:04,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:04,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:04,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:04,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:04,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:21:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821559736] [2025-03-08 16:21:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821559736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577122887] [2025-03-08 16:21:04,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:04,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:04,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:04,778 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:21:04,797 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:21:04,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:05,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:05,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:05,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:05,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:21:05,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:21:05,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577122887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:21:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:21:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491377731] [2025-03-08 16:21:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:05,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:21:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:05,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:21:05,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:05,065 INFO L87 Difference]: Start difference. First operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:05,085 INFO L93 Difference]: Finished difference Result 242 states and 378 transitions. [2025-03-08 16:21:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:21:05,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 16:21:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:05,091 INFO L225 Difference]: With dead ends: 242 [2025-03-08 16:21:05,091 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 16:21:05,094 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:21:05,096 INFO L435 NwaCegarLoop]: 178 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, 178 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:21:05,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 16:21:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-08 16:21:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2025-03-08 16:21:05,138 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2025-03-08 16:21:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:05,139 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2025-03-08 16:21:05,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2025-03-08 16:21:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:05,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:05,145 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:05,152 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:21:05,346 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:21:05,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -101983167, now seen corresponding path program 1 times [2025-03-08 16:21:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349985201] [2025-03-08 16:21:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:05,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:05,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:05,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:05,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:06,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349985201] [2025-03-08 16:21:06,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349985201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:06,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:06,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:21:06,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019497310] [2025-03-08 16:21:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:06,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:21:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:06,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:21:06,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:21:06,038 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:06,208 INFO L93 Difference]: Finished difference Result 315 states and 469 transitions. [2025-03-08 16:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:21:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-08 16:21:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:06,214 INFO L225 Difference]: With dead ends: 315 [2025-03-08 16:21:06,215 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:21:06,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:21:06,218 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 79 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:06,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 485 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:21:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:21:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 122. [2025-03-08 16:21:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2025-03-08 16:21:06,243 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 150 [2025-03-08 16:21:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2025-03-08 16:21:06,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2025-03-08 16:21:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:06,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:06,245 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:06,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:21:06,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2115774786, now seen corresponding path program 1 times [2025-03-08 16:21:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231453277] [2025-03-08 16:21:06,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:06,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:06,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:06,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:06,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:07,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231453277] [2025-03-08 16:21:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231453277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:07,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:21:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862563105] [2025-03-08 16:21:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:07,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:21:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:07,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:21:07,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:21:07,569 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:08,026 INFO L93 Difference]: Finished difference Result 338 states and 496 transitions. [2025-03-08 16:21:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:21:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 16:21:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:08,028 INFO L225 Difference]: With dead ends: 338 [2025-03-08 16:21:08,028 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 16:21:08,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:21:08,030 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 131 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 2292 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:08,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 2292 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:21:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 16:21:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-03-08 16:21:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 182 states have internal predecessors, (253), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:21:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 317 transitions. [2025-03-08 16:21:08,060 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 317 transitions. Word has length 150 [2025-03-08 16:21:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 317 transitions. [2025-03-08 16:21:08,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 317 transitions. [2025-03-08 16:21:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:08,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:08,063 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:08,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:21:08,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:08,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1919261281, now seen corresponding path program 1 times [2025-03-08 16:21:08,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874493747] [2025-03-08 16:21:08,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:08,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:08,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:08,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:08,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:21:08,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:21:08,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:08,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:08,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:21:08,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:21:08,253 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:21:08,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:21:08,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:21:08,259 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 16:21:08,329 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:21:08,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:21:08 BoogieIcfgContainer [2025-03-08 16:21:08,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:21:08,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:21:08,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:21:08,333 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:21:08,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:04" (3/4) ... [2025-03-08 16:21:08,335 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:21:08,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:21:08,337 INFO L158 Benchmark]: Toolchain (without parser) took 4890.62ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.1MB in the beginning and 94.2MB in the end (delta: 27.9MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2025-03-08 16:21:08,337 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:08,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.29ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 106.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:21:08,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.38ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 102.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:08,338 INFO L158 Benchmark]: Boogie Preprocessor took 80.85ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 98.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:21:08,338 INFO L158 Benchmark]: IcfgBuilder took 501.25ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 63.2MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:21:08,338 INFO L158 Benchmark]: TraceAbstraction took 3974.53ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 62.4MB in the beginning and 94.3MB in the end (delta: -31.9MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2025-03-08 16:21:08,338 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 201.3MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:08,340 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.37ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.29ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 106.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.38ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 102.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.85ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 98.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 501.25ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 63.2MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3974.53ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 62.4MB in the beginning and 94.3MB in the end (delta: -31.9MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 201.3MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L31] unsigned char last_1_BOOL_unsigned_char_Array_0_1__0_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] EXPR BOOL_unsigned_char_Array_0[1][0] [L96] last_1_BOOL_unsigned_char_Array_0_1__0_ = BOOL_unsigned_char_Array_0[1][0] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L66] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L69] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L72] double_Array_0[0] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[0] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L73] EXPR double_Array_0[0] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L76] double_Array_0[2] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L78] double_Array_0[3] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L80] double_Array_0[4] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L91] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L92] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L107] RET updateVariables() [L108] CALL step() [L35] unsigned char stepLocal_0 = last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_; [L36] EXPR double_Array_0[1] [L36] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L36] COND TRUE (double_Array_0[1] > double_Array_0[0]) || stepLocal_0 [L37] EXPR BOOL_unsigned_char_Array_0[0][1] [L37] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[0][1] [L41] EXPR BOOL_unsigned_char_Array_0[0][0] [L41] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[0][0]; [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L42] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0][0]) [L49] EXPR BOOL_unsigned_char_Array_0[1][1] [L49] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L51] EXPR double_Array_0[4] [L51] EXPR double_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L51] EXPR double_Array_0[4] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L51] EXPR double_Array_0[2] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) [L54] EXPR double_Array_0[4] [L54] EXPR double_Array_0[3] [L54] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L54] COND FALSE !(double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) [L61] EXPR unsigned_long_int_Array_0[3] [L61] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[3] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR double_Array_0[4] [L99] EXPR double_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L99] EXPR double_Array_0[4] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L99] EXPR double_Array_0[2] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) [L99] EXPR unsigned_long_int_Array_0[4] [L99] EXPR unsigned_long_int_Array_0[3] [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])) [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99-L100] return (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 200 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 2955 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2338 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 617 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 78 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 1019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 499 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 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:21:08,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.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 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:21:10,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:21:10,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:21:10,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:21:10,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:21:10,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:21:10,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:21:10,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:21:10,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:21:10,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:21:10,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:21:10,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:21:10,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:21:10,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:21:10,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:21:10,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:21:10,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:21:10,323 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:21:10,323 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:21:10,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:21:10,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:21:10,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:21:10,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:21:10,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:21:10,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:10,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:21:10,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:21:10,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:21:10,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:21:10,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:21:10,327 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 -> 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 [2025-03-08 16:21:10,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:21:10,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:21:10,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:21:10,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:21:10,576 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:21:10,576 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-74.i [2025-03-08 16:21:11,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea85603a3/9b5c3e2a59f5495d9b7efe84ed55da0c/FLAG3cb354081 [2025-03-08 16:21:11,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:21:11,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2025-03-08 16:21:11,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea85603a3/9b5c3e2a59f5495d9b7efe84ed55da0c/FLAG3cb354081 [2025-03-08 16:21:12,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea85603a3/9b5c3e2a59f5495d9b7efe84ed55da0c [2025-03-08 16:21:12,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:21:12,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:21:12,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:12,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:21:12,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:21:12,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc2b83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12, skipping insertion in model container [2025-03-08 16:21:12,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:21:12,478 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-74.i[916,929] [2025-03-08 16:21:12,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:12,554 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:21:12,564 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-74.i[916,929] [2025-03-08 16:21:12,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:12,639 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:21:12,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12 WrapperNode [2025-03-08 16:21:12,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:12,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:12,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:21:12,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:21:12,646 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:21:12" (1/1) ... [2025-03-08 16:21:12,660 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:21:12" (1/1) ... [2025-03-08 16:21:12,696 INFO L138 Inliner]: procedures = 33, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 577 [2025-03-08 16:21:12,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:12,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:21:12,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:21:12,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:21:12,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,742 INFO L175 MemorySlicer]: Split 152 memory accesses to 4 slices as follows [2, 37, 70, 43]. 46 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 20 writes are split as follows [0, 7, 5, 8]. [2025-03-08 16:21:12,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:21:12,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:21:12,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:21:12,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:21:12,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (1/1) ... [2025-03-08 16:21:12,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:12,809 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:21:12,811 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:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:21:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:21:12,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:21:12,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:21:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:21:12,926 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:21:12,928 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:21:14,235 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite141#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite150#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1;havoc property_#t~short151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short154#1;havoc property_#t~ite164#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~ite161#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short165#1; [2025-03-08 16:21:14,264 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-08 16:21:14,265 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:21:14,275 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:21:14,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:21:14,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:14 BoogieIcfgContainer [2025-03-08 16:21:14,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:21:14,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:21:14,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:21:14,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:21:14,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:21:12" (1/3) ... [2025-03-08 16:21:14,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37599b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:14, skipping insertion in model container [2025-03-08 16:21:14,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:12" (2/3) ... [2025-03-08 16:21:14,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37599b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:14, skipping insertion in model container [2025-03-08 16:21:14,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:14" (3/3) ... [2025-03-08 16:21:14,283 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-74.i [2025-03-08 16:21:14,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:21:14,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-74.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:21:14,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:21:14,335 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;@cf44fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:21:14,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:21:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:14,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:14,346 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:14,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash -510266714, now seen corresponding path program 1 times [2025-03-08 16:21:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:14,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48220753] [2025-03-08 16:21:14,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:14,357 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:21:14,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:14,360 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:21:14,362 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:21:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:14,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:14,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:14,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:14,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:21:14,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-08 16:21:14,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:14,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48220753] [2025-03-08 16:21:14,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48220753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:14,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:14,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:21:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742349429] [2025-03-08 16:21:14,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:14,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:21:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:14,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:21:14,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:14,782 INFO L87 Difference]: Start difference. First operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:14,802 INFO L93 Difference]: Finished difference Result 242 states and 378 transitions. [2025-03-08 16:21:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:21:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 16:21:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:14,808 INFO L225 Difference]: With dead ends: 242 [2025-03-08 16:21:14,808 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 16:21:14,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:21:14,812 INFO L435 NwaCegarLoop]: 178 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, 178 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:21:14,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 16:21:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-08 16:21:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2025-03-08 16:21:14,841 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2025-03-08 16:21:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:14,841 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2025-03-08 16:21:14,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2025-03-08 16:21:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:14,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:14,844 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:21:15,044 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:21:15,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:15,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -101983167, now seen corresponding path program 1 times [2025-03-08 16:21:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:15,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945746258] [2025-03-08 16:21:15,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:15,046 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:21:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:15,049 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:21:15,050 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:21:15,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:15,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:15,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:15,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:15,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:21:15,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:15,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:15,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945746258] [2025-03-08 16:21:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945746258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:15,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:15,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:21:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70803532] [2025-03-08 16:21:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:15,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:21:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:15,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:21:15,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:21:15,462 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:15,577 INFO L93 Difference]: Finished difference Result 240 states and 355 transitions. [2025-03-08 16:21:15,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:21:15,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-08 16:21:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:15,581 INFO L225 Difference]: With dead ends: 240 [2025-03-08 16:21:15,581 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 16:21:15,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:21:15,582 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:15,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:21:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 16:21:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 16:21:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2025-03-08 16:21:15,597 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 150 [2025-03-08 16:21:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:15,599 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2025-03-08 16:21:15,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2025-03-08 16:21:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:15,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:15,601 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:15,613 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:21:15,801 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:21:15,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2115774786, now seen corresponding path program 1 times [2025-03-08 16:21:15,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:15,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007006414] [2025-03-08 16:21:15,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:15,803 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:21:15,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:15,805 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:21:15,807 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:21:15,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:16,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:16,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:16,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:16,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:21:16,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:18,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:18,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 415 treesize of output 127 [2025-03-08 16:21:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-08 16:21:18,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:21:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:19,158 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007006414] [2025-03-08 16:21:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007006414] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:19,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:21:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2025-03-08 16:21:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382465608] [2025-03-08 16:21:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:19,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:21:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:19,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:21:19,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:21:19,159 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:21,687 INFO L93 Difference]: Finished difference Result 301 states and 440 transitions. [2025-03-08 16:21:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:21:21,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-08 16:21:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:21,690 INFO L225 Difference]: With dead ends: 301 [2025-03-08 16:21:21,690 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 16:21:21,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:21:21,691 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 142 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:21,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 771 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 16:21:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 16:21:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-03-08 16:21:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 155 states have internal predecessors, (217), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 16:21:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 261 transitions. [2025-03-08 16:21:21,710 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 261 transitions. Word has length 150 [2025-03-08 16:21:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:21,710 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 261 transitions. [2025-03-08 16:21:21,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 261 transitions. [2025-03-08 16:21:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:21:21,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:21,713 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:21,725 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:21:21,914 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:21:21,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2084941435, now seen corresponding path program 1 times [2025-03-08 16:21:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917699111] [2025-03-08 16:21:21,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:21,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:21,920 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:21:21,922 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:21:22,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:21:22,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:21:22,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:22,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:22,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:21:22,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:22,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:21:22,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-03-08 16:21:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:22,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:22,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917699111] [2025-03-08 16:21:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917699111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:22,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:21:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670611058] [2025-03-08 16:21:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:22,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:21:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:22,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:21:22,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:22,585 INFO L87 Difference]: Start difference. First operand 179 states and 261 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:23,193 INFO L93 Difference]: Finished difference Result 508 states and 739 transitions. [2025-03-08 16:21:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:21:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-08 16:21:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:23,197 INFO L225 Difference]: With dead ends: 508 [2025-03-08 16:21:23,197 INFO L226 Difference]: Without dead ends: 332 [2025-03-08 16:21:23,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:21:23,198 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 130 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:23,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1229 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:21:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-08 16:21:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2025-03-08 16:21:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 282 states have (on average 1.3936170212765957) internal successors, (393), 285 states have internal predecessors, (393), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 16:21:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 477 transitions. [2025-03-08 16:21:23,226 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 477 transitions. Word has length 150 [2025-03-08 16:21:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:23,227 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 477 transitions. [2025-03-08 16:21:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 477 transitions. [2025-03-08 16:21:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:21:23,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:23,228 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:23,242 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:21:23,429 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:21:23,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 320284989, now seen corresponding path program 1 times [2025-03-08 16:21:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704400715] [2025-03-08 16:21:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:23,430 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:21:23,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:23,432 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:21:23,433 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:21:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.