./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.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 b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:24:31,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:24:31,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:24:31,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:24:31,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:24:31,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:24:31,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:24:31,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:24:31,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:24:31,477 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:24:31,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:24:31,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:24:31,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:24:31,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:24:31,478 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:24:31,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:24:31,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:24:31,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:24:31,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:24:31,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:24:31,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:24:31,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:24:31,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:24:31,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:24:31,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:24:31,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:31,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:24:31,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:24:31,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:24:31,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:24:31,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:24:31,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:24:31,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:24:31,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:24:31,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:24:31,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:24:31,482 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 -> b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 [2025-03-17 05:24:31,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:24:31,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:24:31,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:24:31,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:24:31,734 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:24:31,735 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-50.i [2025-03-17 05:24:32,929 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9dd6e77e/6f58b11bdc1d45f6b50ee9f37949f4bf/FLAG2d2243406 [2025-03-17 05:24:33,212 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:24:33,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i [2025-03-17 05:24:33,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9dd6e77e/6f58b11bdc1d45f6b50ee9f37949f4bf/FLAG2d2243406 [2025-03-17 05:24:33,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9dd6e77e/6f58b11bdc1d45f6b50ee9f37949f4bf [2025-03-17 05:24:33,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:24:33,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:24:33,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:33,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:24:33,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:24:33,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33, skipping insertion in model container [2025-03-17 05:24:33,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:24:33,371 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-50.i[916,929] [2025-03-17 05:24:33,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:33,433 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:24:33,442 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-50.i[916,929] [2025-03-17 05:24:33,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:33,499 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:24:33,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33 WrapperNode [2025-03-17 05:24:33,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:33,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:33,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:24:33,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:24:33,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,544 INFO L138 Inliner]: procedures = 29, calls = 211, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 595 [2025-03-17 05:24:33,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:33,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:24:33,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:24:33,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:24:33,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,572 INFO L175 MemorySlicer]: Split 170 memory accesses to 5 slices as follows [2, 31, 40, 30, 67]. 39 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 4, 4, 4, 6]. The 23 writes are split as follows [0, 7, 4, 5, 7]. [2025-03-17 05:24:33,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:24:33,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:24:33,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:24:33,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:24:33,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (1/1) ... [2025-03-17 05:24:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:33,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:33,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:24:33,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:24:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:24:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:24:33,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:24:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:24:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:24:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:24:33,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:24:33,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:24:33,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:24:34,203 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite140#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem129#1;havoc property_#t~ite134#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~ite157#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem156#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~ite155#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short158#1;havoc property_#t~mem161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite172#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite169#1;havoc property_#t~mem168#1;havoc property_#t~mem166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1; [2025-03-17 05:24:34,248 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-03-17 05:24:34,248 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:24:34,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:24:34,257 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:24:34,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:34 BoogieIcfgContainer [2025-03-17 05:24:34,257 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:24:34,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:24:34,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:24:34,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:24:34,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:24:33" (1/3) ... [2025-03-17 05:24:34,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760d0d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:34, skipping insertion in model container [2025-03-17 05:24:34,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:33" (2/3) ... [2025-03-17 05:24:34,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760d0d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:34, skipping insertion in model container [2025-03-17 05:24:34,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:34" (3/3) ... [2025-03-17 05:24:34,264 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-50.i [2025-03-17 05:24:34,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:24:34,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-50.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:24:34,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:24:34,324 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;@42bb06c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:24:34,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:24:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 95 states have (on average 1.4) internal successors, (133), 96 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:24:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 05:24:34,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:34,338 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:34,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:34,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807912, now seen corresponding path program 1 times [2025-03-17 05:24:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812512720] [2025-03-17 05:24:34,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:34,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 05:24:34,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 05:24:34,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:34,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 05:24:34,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812512720] [2025-03-17 05:24:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812512720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308301129] [2025-03-17 05:24:34,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:34,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:34,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:34,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:24:34,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:24:34,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 05:24:34,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 05:24:34,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:34,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:34,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:24:34,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 05:24:34,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308301129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:34,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:34,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:24:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780618702] [2025-03-17 05:24:34,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:34,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:24:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:34,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:24:34,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:34,991 INFO L87 Difference]: Start difference. First operand has 124 states, 95 states have (on average 1.4) internal successors, (133), 96 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:35,015 INFO L93 Difference]: Finished difference Result 245 states and 394 transitions. [2025-03-17 05:24:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:24:35,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 191 [2025-03-17 05:24:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:35,024 INFO L225 Difference]: With dead ends: 245 [2025-03-17 05:24:35,025 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:24:35,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:35,029 INFO L435 NwaCegarLoop]: 181 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, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:35,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:24:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 05:24:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:24:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2025-03-17 05:24:35,062 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 191 [2025-03-17 05:24:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:35,063 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2025-03-17 05:24:35,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2025-03-17 05:24:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 05:24:35,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:35,065 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:35,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:24:35,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:24:35,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:35,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -714998850, now seen corresponding path program 1 times [2025-03-17 05:24:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804129946] [2025-03-17 05:24:35,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:35,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:35,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 05:24:35,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 05:24:35,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:35,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 05:24:35,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:35,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804129946] [2025-03-17 05:24:35,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804129946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:35,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:35,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:24:35,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469811708] [2025-03-17 05:24:35,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:35,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:35,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:35,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:35,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:35,786 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:36,012 INFO L93 Difference]: Finished difference Result 395 states and 586 transitions. [2025-03-17 05:24:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 191 [2025-03-17 05:24:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:36,016 INFO L225 Difference]: With dead ends: 395 [2025-03-17 05:24:36,016 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 05:24:36,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:36,017 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 310 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:36,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 747 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:24:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 05:24:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 256. [2025-03-17 05:24:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 201 states have internal predecessors, (278), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:24:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2025-03-17 05:24:36,056 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 191 [2025-03-17 05:24:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:36,057 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2025-03-17 05:24:36,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2025-03-17 05:24:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 05:24:36,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:36,061 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:36,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:24:36,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:36,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash -587812286, now seen corresponding path program 1 times [2025-03-17 05:24:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436587011] [2025-03-17 05:24:36,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:36,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 05:24:36,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 05:24:36,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:36,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 05:24:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436587011] [2025-03-17 05:24:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436587011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:37,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:24:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864390585] [2025-03-17 05:24:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:37,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:37,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:37,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:37,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:37,215 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:37,380 INFO L93 Difference]: Finished difference Result 609 states and 899 transitions. [2025-03-17 05:24:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:24:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 191 [2025-03-17 05:24:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:37,384 INFO L225 Difference]: With dead ends: 609 [2025-03-17 05:24:37,384 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 05:24:37,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:24:37,386 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 54 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:37,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 926 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 05:24:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2025-03-17 05:24:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 285 states have (on average 1.3754385964912281) internal successors, (392), 287 states have internal predecessors, (392), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:24:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 512 transitions. [2025-03-17 05:24:37,428 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 512 transitions. Word has length 191 [2025-03-17 05:24:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:37,430 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 512 transitions. [2025-03-17 05:24:37,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 512 transitions. [2025-03-17 05:24:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 05:24:37,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:37,433 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:37,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:24:37,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:37,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 521368251, now seen corresponding path program 1 times [2025-03-17 05:24:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:37,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671574730] [2025-03-17 05:24:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:37,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:24:37,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:24:37,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:24:37,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:24:37,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 05:24:37,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 05:24:37,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:37,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:24:37,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:24:37,744 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:24:37,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:24:37,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:24:37,750 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 05:24:37,829 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:24:37,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:24:37 BoogieIcfgContainer [2025-03-17 05:24:37,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:24:37,833 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:24:37,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:24:37,833 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:24:37,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:34" (3/4) ... [2025-03-17 05:24:37,835 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:24:37,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:24:37,837 INFO L158 Benchmark]: Toolchain (without parser) took 4600.68ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 124.0MB in the beginning and 198.3MB in the end (delta: -74.3MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2025-03-17 05:24:37,839 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:37,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.87ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 106.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:24:37,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.81ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:37,841 INFO L158 Benchmark]: Boogie Preprocessor took 49.75ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 98.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:24:37,841 INFO L158 Benchmark]: IcfgBuilder took 661.75ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 62.1MB in the end (delta: 36.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:24:37,841 INFO L158 Benchmark]: TraceAbstraction took 3573.49ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 62.1MB in the beginning and 198.4MB in the end (delta: -136.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-03-17 05:24:37,841 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 335.5MB. Free memory was 198.4MB in the beginning and 198.3MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:37,842 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.87ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 106.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.81ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.75ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 98.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 661.75ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 62.1MB in the end (delta: 36.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3573.49ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 62.1MB in the beginning and 198.4MB in the end (delta: -136.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 335.5MB. Free memory was 198.4MB in the beginning and 198.3MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, 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}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L34] signed long int last_1_signed_long_int_Array_0_0__1_ = -5; [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] EXPR signed_long_int_Array_0[0][1] [L112] last_1_signed_long_int_Array_0_0__1_ = signed_long_int_Array_0[0][1] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L76] 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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] 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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] 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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] 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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] 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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] 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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] double_Array_0[0][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] double_Array_0[1][0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] double_Array_0[0][1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] double_Array_0[1][1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] signed_long_int_Array_0[1][0] = __VERIFIER_nondet_long() [L90] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_long_int_Array_0[1][0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_long_int_Array_0[1][1] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[1][1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[1][1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L96] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L96] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L96] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L98] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L99] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L99] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L99] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] signed_short_int_Array_0[1][1] = __VERIFIER_nondet_short() [L102] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L102] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L102] RET assume_abort_if_not(signed_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] RET assume_abort_if_not(signed_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L104] signed_short_int_Array_0[0][2] = __VERIFIER_nondet_short() [L105] EXPR signed_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] CALL assume_abort_if_not(signed_short_int_Array_0[0][2] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] RET assume_abort_if_not(signed_short_int_Array_0[0][2] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] EXPR signed_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] CALL assume_abort_if_not(signed_short_int_Array_0[0][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] RET assume_abort_if_not(signed_short_int_Array_0[0][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L107] signed_short_int_Array_0[1][2] = __VERIFIER_nondet_short() [L108] EXPR signed_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L108] CALL assume_abort_if_not(signed_short_int_Array_0[1][2] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L108] RET assume_abort_if_not(signed_short_int_Array_0[1][2] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] EXPR signed_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] CALL assume_abort_if_not(signed_short_int_Array_0[1][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7: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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET assume_abort_if_not(signed_short_int_Array_0[1][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L123] RET updateVariables() [L124] CALL step() [L38] signed long int stepLocal_1 = last_1_signed_long_int_Array_0_0__1_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-5] [L39] COND FALSE !(stepLocal_1 >= 0) [L42] EXPR signed_short_int_Array_0[1][0] [L42] EXPR signed_short_int_Array_0[1][2] [L42] EXPR signed_short_int_Array_0[0][1] [L42] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L42] EXPR ((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))) [L42] EXPR signed_short_int_Array_0[1][0] [L42] EXPR ((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L42] signed_short_int_Array_0[0][0] = ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))) [L44] EXPR signed_short_int_Array_0[1][2] [L44] EXPR signed_long_int_Array_0[1][1] [L44] signed long int stepLocal_3 = signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1]; [L45] EXPR signed_short_int_Array_0[0][0] [L45] signed short int stepLocal_2 = signed_short_int_Array_0[0][0]; [L46] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND FALSE !(signed_short_int_Array_0[0][0] > stepLocal_3) [L51] EXPR signed_short_int_Array_0[0][2] [L51] signed_long_int_Array_0[0][1] = signed_short_int_Array_0[0][2] [L53] EXPR signed_short_int_Array_0[0][0] [L53] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L53] EXPR ((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]) [L53] EXPR signed_short_int_Array_0[0][0] [L53] EXPR ((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=32766] [L53] signed long int stepLocal_0 = (((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1])); [L54] EXPR double_Array_0[1][1] [L54] EXPR double_Array_0[0][1] [L54] EXPR double_Array_0[1][0] [L54] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L54] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) [L54] EXPR double_Array_0[1][1] [L54] EXPR double_Array_0[0][1] [L54] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=32766, stepLocal_2=32766] [L54] COND TRUE (((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9 [L55] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L55] COND FALSE !(stepLocal_0 < signed_long_int_Array_0[0][1]) [L62] EXPR BOOL_unsigned_char_Array_0[1][0] [L62] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR double_Array_0[1][1] [L115] EXPR double_Array_0[0][1] [L115] EXPR double_Array_0[1][0] [L115] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) [L115] EXPR double_Array_0[1][1] [L115] EXPR double_Array_0[0][1] [L115] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) [L115] EXPR BOOL_unsigned_char_Array_0[1][1] [L115] EXPR BOOL_unsigned_char_Array_0[0][1] [L115] EXPR ((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115-L116] return ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) ; [L125] RET, EXPR property() [L125] 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_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 211 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 1854 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1265 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 589 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 956 NumberOfCodeBlocks, 956 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 1595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 642 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5150/5200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:24:37,860 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-50.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 b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:24:39,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:24:39,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:24:39,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:24:39,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:24:39,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:24:39,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:24:39,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:24:39,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:24:39,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:24:39,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:24:39,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:24:39,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:24:39,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:24:39,876 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:24:39,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:24:39,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:24:39,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:24:39,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:24:39,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:24:39,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:24:39,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:24:39,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:24:39,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:24:39,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:24:39,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:24:39,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:39,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:24:39,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:24:39,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:24:39,879 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 -> b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 [2025-03-17 05:24:40,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:24:40,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:24:40,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:24:40,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:24:40,117 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:24:40,118 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-50.i [2025-03-17 05:24:41,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4275b4019/82ebd02e44dd433ca4013e9c7b1720a2/FLAGd7dc802b4 [2025-03-17 05:24:41,442 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:24:41,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i [2025-03-17 05:24:41,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4275b4019/82ebd02e44dd433ca4013e9c7b1720a2/FLAGd7dc802b4 [2025-03-17 05:24:41,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4275b4019/82ebd02e44dd433ca4013e9c7b1720a2 [2025-03-17 05:24:41,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:24:41,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:24:41,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:41,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:24:41,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:24:41,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:41" (1/1) ... [2025-03-17 05:24:41,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67111ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:41, skipping insertion in model container [2025-03-17 05:24:41,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:41" (1/1) ... [2025-03-17 05:24:41,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:24:41,957 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-50.i[916,929] [2025-03-17 05:24:42,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:42,026 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:24:42,033 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-50.i[916,929] [2025-03-17 05:24:42,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:42,106 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:24:42,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42 WrapperNode [2025-03-17 05:24:42,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:42,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:42,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:24:42,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:24:42,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,161 INFO L138 Inliner]: procedures = 36, calls = 211, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 587 [2025-03-17 05:24:42,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:42,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:24:42,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:24:42,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:24:42,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,210 INFO L175 MemorySlicer]: Split 170 memory accesses to 5 slices as follows [2, 31, 40, 30, 67]. 39 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 4, 4, 4, 6]. The 23 writes are split as follows [0, 7, 4, 5, 7]. [2025-03-17 05:24:42,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:24:42,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:24:42,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:24:42,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:24:42,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (1/1) ... [2025-03-17 05:24:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:42,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:42,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:24:42,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:24:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:24:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:24:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:24:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:24:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:24:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:24:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:24:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:24:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:24:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:24:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:24:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:24:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:24:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:24:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:24:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:24:42,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:24:42,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:24:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:24:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:24:42,437 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:24:42,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:24:47,201 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite140#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem129#1;havoc property_#t~ite134#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~ite157#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem156#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~ite155#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short158#1;havoc property_#t~mem161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite172#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite169#1;havoc property_#t~mem168#1;havoc property_#t~mem166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1; [2025-03-17 05:24:47,228 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-03-17 05:24:47,228 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:24:47,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:24:47,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:24:47,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:47 BoogieIcfgContainer [2025-03-17 05:24:47,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:24:47,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:24:47,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:24:47,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:24:47,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:24:41" (1/3) ... [2025-03-17 05:24:47,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7b11fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:47, skipping insertion in model container [2025-03-17 05:24:47,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:42" (2/3) ... [2025-03-17 05:24:47,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7b11fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:47, skipping insertion in model container [2025-03-17 05:24:47,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:47" (3/3) ... [2025-03-17 05:24:47,242 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-50.i [2025-03-17 05:24:47,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:24:47,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-50.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:24:47,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:24:47,303 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;@2b5857fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:24:47,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:24:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 95 states have (on average 1.4) internal successors, (133), 96 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:24:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 05:24:47,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:47,315 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:47,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:47,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807912, now seen corresponding path program 1 times [2025-03-17 05:24:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447280168] [2025-03-17 05:24:47,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:47,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:47,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:47,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:47,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:24:47,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 05:24:47,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 05:24:47,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:47,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:47,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:24:47,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-17 05:24:48,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:48,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:48,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447280168] [2025-03-17 05:24:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447280168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:48,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:48,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:24:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744411859] [2025-03-17 05:24:48,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:48,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:24:48,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:48,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:24:48,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:48,029 INFO L87 Difference]: Start difference. First operand has 124 states, 95 states have (on average 1.4) internal successors, (133), 96 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:48,050 INFO L93 Difference]: Finished difference Result 245 states and 394 transitions. [2025-03-17 05:24:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:24:48,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 191 [2025-03-17 05:24:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:48,056 INFO L225 Difference]: With dead ends: 245 [2025-03-17 05:24:48,056 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:24:48,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:48,060 INFO L435 NwaCegarLoop]: 181 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, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:48,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:24:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 05:24:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:24:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2025-03-17 05:24:48,095 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 191 [2025-03-17 05:24:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:48,096 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2025-03-17 05:24:48,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2025-03-17 05:24:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 05:24:48,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:48,099 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:48,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:24:48,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:48,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:48,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash -714998850, now seen corresponding path program 1 times [2025-03-17 05:24:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:48,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672765306] [2025-03-17 05:24:48,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:48,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:48,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:48,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:48,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:24:48,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 05:24:48,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 05:24:48,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:48,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:48,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:24:48,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 05:24:49,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:49,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672765306] [2025-03-17 05:24:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672765306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:49,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:24:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402046153] [2025-03-17 05:24:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:49,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:49,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:24:49,639 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:24:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:50,123 INFO L93 Difference]: Finished difference Result 395 states and 586 transitions. [2025-03-17 05:24:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 191 [2025-03-17 05:24:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:50,128 INFO L225 Difference]: With dead ends: 395 [2025-03-17 05:24:50,128 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 05:24:50,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:50,129 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 194 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:50,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 747 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:24:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 05:24:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 256. [2025-03-17 05:24:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 201 states have internal predecessors, (278), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:24:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2025-03-17 05:24:50,158 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 191 [2025-03-17 05:24:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:50,158 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2025-03-17 05:24:50,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:24:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2025-03-17 05:24:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 05:24:50,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:50,160 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:50,179 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-17 05:24:50,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:50,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:50,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash -587812286, now seen corresponding path program 1 times [2025-03-17 05:24:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383643831] [2025-03-17 05:24:50,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:50,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:50,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:24:50,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 05:24:50,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 05:24:50,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:50,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:50,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:24:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:51,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:51,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-17 05:24:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-17 05:24:51,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:51,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383643831] [2025-03-17 05:24:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383643831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:51,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:24:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527514265] [2025-03-17 05:24:51,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:51,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:24:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:51,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:24:51,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:24:51,255 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:24:53,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:24:57,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:24:58,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:25:01,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:25:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:01,370 INFO L93 Difference]: Finished difference Result 513 states and 765 transitions. [2025-03-17 05:25:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:01,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 191 [2025-03-17 05:25:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:01,374 INFO L225 Difference]: With dead ends: 513 [2025-03-17 05:25:01,374 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 05:25:01,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:25:01,379 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 157 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:01,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 554 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2025-03-17 05:25:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 05:25:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-03-17 05:25:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.373134328358209) internal successors, (276), 201 states have internal predecessors, (276), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:25:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2025-03-17 05:25:01,406 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 191 [2025-03-17 05:25:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:01,406 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2025-03-17 05:25:01,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:25:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2025-03-17 05:25:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 05:25:01,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:01,408 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:01,431 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:01,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:01,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:01,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash 729066144, now seen corresponding path program 1 times [2025-03-17 05:25:01,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:01,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582082050] [2025-03-17 05:25:01,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:01,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:01,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:01,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:01,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:25:01,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 05:25:02,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 05:25:02,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:02,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:02,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:25:02,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:02,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:02,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 05:25:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-17 05:25:02,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:02,445 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582082050] [2025-03-17 05:25:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582082050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276755419] [2025-03-17 05:25:02,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:02,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:02,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:02,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:02,448 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:25:05,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:25:07,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:25:10,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:25:12,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:25:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:12,709 INFO L93 Difference]: Finished difference Result 513 states and 761 transitions. [2025-03-17 05:25:12,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:12,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 193 [2025-03-17 05:25:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:12,712 INFO L225 Difference]: With dead ends: 513 [2025-03-17 05:25:12,712 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 05:25:12,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:25:12,714 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 149 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:12,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 550 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-03-17 05:25:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 05:25:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-03-17 05:25:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:25:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2025-03-17 05:25:12,738 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 193 [2025-03-17 05:25:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:12,738 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2025-03-17 05:25:12,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:25:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2025-03-17 05:25:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 05:25:12,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:12,744 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:12,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:25:12,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:12,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:12,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2066030910, now seen corresponding path program 1 times [2025-03-17 05:25:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541433837] [2025-03-17 05:25:12,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:12,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:12,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:12,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:12,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:25:13,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 05:25:13,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 05:25:13,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:13,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:14,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:25:14,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:14,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:25:14,477 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 33 treesize of output 26 [2025-03-17 05:25:14,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:14,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 35 [2025-03-17 05:25:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-03-17 05:25:14,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 05:25:14,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541433837] [2025-03-17 05:25:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541433837] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:14,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2025-03-17 05:25:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950211759] [2025-03-17 05:25:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:14,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:14,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:14,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:25:14,893 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:25:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:15,200 INFO L93 Difference]: Finished difference Result 609 states and 891 transitions. [2025-03-17 05:25:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:15,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 195 [2025-03-17 05:25:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:15,204 INFO L225 Difference]: With dead ends: 609 [2025-03-17 05:25:15,204 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 05:25:15,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:25:15,207 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 54 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:15,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 743 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 05:25:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2025-03-17 05:25:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 285 states have (on average 1.3614035087719298) internal successors, (388), 287 states have internal predecessors, (388), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:25:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 508 transitions. [2025-03-17 05:25:15,230 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 508 transitions. Word has length 195 [2025-03-17 05:25:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:15,231 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 508 transitions. [2025-03-17 05:25:15,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:25:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 508 transitions. [2025-03-17 05:25:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-17 05:25:15,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:15,232 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:15,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:25:15,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:15,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:15,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1941231163, now seen corresponding path program 1 times [2025-03-17 05:25:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296182183] [2025-03-17 05:25:15,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:15,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:15,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:15,436 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:15,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:25:15,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 05:25:21,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 05:25:21,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:21,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:21,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:25:21,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:32,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:32,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 320 treesize of output 104 [2025-03-17 05:25:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-17 05:25:42,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:42,124 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296182183] [2025-03-17 05:25:42,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296182183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:42,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:42,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:25:42,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303044428] [2025-03-17 05:25:42,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:42,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:25:42,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:42,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:25:42,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:42,126 INFO L87 Difference]: Start difference. First operand 350 states and 508 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:25:44,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:46,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:50,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:51,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:53,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:54,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:56,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:57,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:58,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:00,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:02,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:04,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:05,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:08,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:10,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:12,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]