./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.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-51.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 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:24:38,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:24:38,279 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:38,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:24:38,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:24:38,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:24:38,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:24:38,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:24:38,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:24:38,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:24:38,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:24:38,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:24:38,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:24:38,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:24:38,309 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:24:38,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:24:38,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:24:38,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:24:38,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:24:38,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:24:38,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:24:38,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:24:38,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:38,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:24:38,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:24:38,312 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 -> 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c [2025-03-17 05:24:38,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:24:38,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:24:38,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:24:38,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:24:38,664 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:24:38,664 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-51.i [2025-03-17 05:24:39,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eef09143/9bb8b0e4019240bcbbe8452426ea0d15/FLAGae4cfbc30 [2025-03-17 05:24:40,100 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:24:40,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.i [2025-03-17 05:24:40,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eef09143/9bb8b0e4019240bcbbe8452426ea0d15/FLAGae4cfbc30 [2025-03-17 05:24:40,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eef09143/9bb8b0e4019240bcbbe8452426ea0d15 [2025-03-17 05:24:40,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:24:40,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:24:40,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:40,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:24:40,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:24:40,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:40" (1/1) ... [2025-03-17 05:24:40,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c438aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:40, skipping insertion in model container [2025-03-17 05:24:40,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:40" (1/1) ... [2025-03-17 05:24:40,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:24:40,266 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-51.i[916,929] [2025-03-17 05:24:40,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:40,354 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:24:40,363 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-51.i[916,929] [2025-03-17 05:24:40,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:40,418 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:24:40,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:40 WrapperNode [2025-03-17 05:24:40,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:40,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:40,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:24:40,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:24:40,423 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:40" (1/1) ... [2025-03-17 05:24:40,431 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:40" (1/1) ... [2025-03-17 05:24:40,458 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-03-17 05:24:40,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:40,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:24:40,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:24:40,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:24:40,467 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:40" (1/1) ... [2025-03-17 05:24:40,467 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:40" (1/1) ... [2025-03-17 05:24:40,471 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:40" (1/1) ... [2025-03-17 05:24:40,487 INFO L175 MemorySlicer]: Split 145 memory accesses to 5 slices as follows [2, 8, 49, 7, 79]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 1, 7]. The 18 writes are split as follows [0, 1, 7, 1, 9]. [2025-03-17 05:24:40,488 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:40" (1/1) ... [2025-03-17 05:24:40,488 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:40" (1/1) ... [2025-03-17 05:24:40,499 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:40" (1/1) ... [2025-03-17 05:24:40,500 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:40" (1/1) ... [2025-03-17 05:24:40,502 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:40" (1/1) ... [2025-03-17 05:24:40,503 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:40" (1/1) ... [2025-03-17 05:24:40,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:24:40,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:24:40,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:24:40,507 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:24:40,507 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:40" (1/1) ... [2025-03-17 05:24:40,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:40,540 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:40,542 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:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:24:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:24:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:24:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:24:40,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:24:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:24:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:24:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:24:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:24:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:24:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:24:40,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:24:40,672 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:24:40,673 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:24:41,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~mem101#1;havoc property_#t~ite120#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite117#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem126#1;havoc property_#t~ite136#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite156#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~short147#1;havoc property_#t~ite153#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite152#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem155#1;havoc property_#t~mem154#1;havoc property_#t~short157#1; [2025-03-17 05:24:41,081 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-17 05:24:41,081 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:24:41,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:24:41,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:24:41,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:41 BoogieIcfgContainer [2025-03-17 05:24:41,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:24:41,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:24:41,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:24:41,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:24:41,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:24:40" (1/3) ... [2025-03-17 05:24:41,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143d95de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:41, skipping insertion in model container [2025-03-17 05:24:41,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:40" (2/3) ... [2025-03-17 05:24:41,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143d95de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:41, skipping insertion in model container [2025-03-17 05:24:41,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:41" (3/3) ... [2025-03-17 05:24:41,105 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-51.i [2025-03-17 05:24:41,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:24:41,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-51.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:24:41,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:24:41,170 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;@2c82b420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:24:41,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:24:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:24:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:24:41,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:41,186 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:41,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1506384424, now seen corresponding path program 1 times [2025-03-17 05:24:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666136103] [2025-03-17 05:24:41,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:41,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:41,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:41,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:41,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:41,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:24:41,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:41,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666136103] [2025-03-17 05:24:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666136103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629862832] [2025-03-17 05:24:41,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:41,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:41,489 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:41,491 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:41,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:41,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:41,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:41,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:41,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:24:41,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:24:41,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629862832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:24:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268320917] [2025-03-17 05:24:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:41,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:24:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:41,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:24:41,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:41,728 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:24:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:41,747 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2025-03-17 05:24:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:24:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2025-03-17 05:24:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:41,753 INFO L225 Difference]: With dead ends: 233 [2025-03-17 05:24:41,753 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:24:41,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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:41,757 INFO L435 NwaCegarLoop]: 172 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, 172 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:41,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 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:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:24:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:24:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:24:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2025-03-17 05:24:41,790 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 145 [2025-03-17 05:24:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:41,790 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2025-03-17 05:24:41,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:24:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2025-03-17 05:24:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:24:41,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:41,796 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:41,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:41,996 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:41,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:41,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash 6204215, now seen corresponding path program 1 times [2025-03-17 05:24:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:41,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454441351] [2025-03-17 05:24:41,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:42,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:42,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:42,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:42,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:24:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454441351] [2025-03-17 05:24:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454441351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:24:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000638005] [2025-03-17 05:24:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:42,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:24:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:42,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:24:42,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:42,461 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:24:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:42,488 INFO L93 Difference]: Finished difference Result 231 states and 343 transitions. [2025-03-17 05:24:42,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:24:42,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2025-03-17 05:24:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:42,490 INFO L225 Difference]: With dead ends: 231 [2025-03-17 05:24:42,490 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:24:42,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:24:42,491 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:42,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:24:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:24:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:24:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2025-03-17 05:24:42,503 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 145 [2025-03-17 05:24:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:42,504 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2025-03-17 05:24:42,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:24:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2025-03-17 05:24:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:24:42,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:42,506 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:42,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:24:42,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:42,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 996550129, now seen corresponding path program 1 times [2025-03-17 05:24:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171476109] [2025-03-17 05:24:42,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:42,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:24:42,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:24:42,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:42,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:24:42,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:24:42,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:24:42,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:24:42,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:42,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:24:42,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:24:42,846 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:24:42,847 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:24:42,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:24:42,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 05:24:42,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:24:42,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:24:42 BoogieIcfgContainer [2025-03-17 05:24:42,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:24:42,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:24:42,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:24:42,931 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:24:42,931 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:41" (3/4) ... [2025-03-17 05:24:42,933 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:24:42,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:24:42,935 INFO L158 Benchmark]: Toolchain (without parser) took 2802.55ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 112.2MB in the beginning and 291.1MB in the end (delta: -178.9MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2025-03-17 05:24:42,935 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:42,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.59ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:24:42,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:42,937 INFO L158 Benchmark]: Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 89.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:24:42,937 INFO L158 Benchmark]: IcfgBuilder took 590.08ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 54.3MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:24:42,937 INFO L158 Benchmark]: TraceAbstraction took 1831.22ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 53.8MB in the beginning and 291.1MB in the end (delta: -237.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:42,938 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 377.5MB. Free memory was 291.1MB in the beginning and 291.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:42,939 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.59ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 89.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 590.08ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 54.3MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1831.22ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 53.8MB in the beginning and 291.1MB in the end (delta: -237.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 377.5MB. Free memory was 291.1MB in the beginning and 291.1MB in the end (delta: 24.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 someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -16 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -16 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_5_ = 8; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] EXPR unsigned_long_int_Array_0[5] [L97] last_1_unsigned_long_int_Array_0_5_ = unsigned_long_int_Array_0[5] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] double_Array_0[0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] double_Array_0[1] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] double_Array_0[2] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[2] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F [L73] EXPR double_Array_0[2] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] CALL assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] RET assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] double_Array_0[3] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[3] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F [L75] EXPR double_Array_0[3] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L89] unsigned_long_int_Array_0[4] = __VERIFIER_nondet_ulong() [L90] EXPR unsigned_long_int_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[4] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[4] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] EXPR unsigned_long_int_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[4] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[4] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L92] unsigned_long_int_Array_0[6] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[6] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[6] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR unsigned_long_int_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[6] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[6] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = - last_1_unsigned_long_int_Array_0_5_; [L39] EXPR unsigned_long_int_Array_0[3] [L39] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] EXPR ((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]) [L39] EXPR unsigned_long_int_Array_0[3] [L39] EXPR ((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, stepLocal_1=-8, unsigned_long_int_Array_0={7:0}] [L39] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != stepLocal_1) [L42] EXPR unsigned_long_int_Array_0[6] [L42] unsigned_long_int_Array_0[2] = unsigned_long_int_Array_0[6] [L44] EXPR unsigned_long_int_Array_0[2] [L44] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L44] COND TRUE unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2] [L45] EXPR BOOL_unsigned_char_Array_0[0] [L45] BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L45] BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) [L53] EXPR unsigned_long_int_Array_0[2] [L53] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[2]; [L54] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L61] EXPR double_Array_0[1] [L61] double_Array_0[4] = double_Array_0[1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1])) [L100] EXPR double_Array_0[4] [L100] EXPR double_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100-L101] return ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) ; [L110] RET, EXPR property() [L110] 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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_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_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 195 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 509 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 342 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:24:42,962 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-51.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 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:24:44,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:24:45,014 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:45,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:24:45,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:24:45,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:24:45,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:24:45,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:24:45,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:24:45,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:24:45,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:24:45,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:24:45,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:24:45,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:24:45,050 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:24:45,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:24:45,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:24:45,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:24:45,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:24:45,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:24:45,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:24:45,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:24:45,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:24:45,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:24:45,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:24:45,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:45,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:24:45,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:24:45,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:24:45,054 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 -> 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c [2025-03-17 05:24:45,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:24:45,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:24:45,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:24:45,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:24:45,365 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:24:45,366 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-51.i [2025-03-17 05:24:46,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797bb234b/6b14a5ee1340467a956aeedf169984a3/FLAG5af02562b [2025-03-17 05:24:46,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:24:46,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.i [2025-03-17 05:24:46,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797bb234b/6b14a5ee1340467a956aeedf169984a3/FLAG5af02562b [2025-03-17 05:24:47,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797bb234b/6b14a5ee1340467a956aeedf169984a3 [2025-03-17 05:24:47,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:24:47,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:24:47,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:47,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:24:47,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:24:47,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:47" (1/1) ... [2025-03-17 05:24:47,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7a081e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:47, skipping insertion in model container [2025-03-17 05:24:47,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:47" (1/1) ... [2025-03-17 05:24:47,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:24:47,256 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-51.i[916,929] [2025-03-17 05:24:47,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:47,339 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:24:47,346 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-51.i[916,929] [2025-03-17 05:24:47,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:47,401 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:24:47,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:47 WrapperNode [2025-03-17 05:24:47,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:47,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:47,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:24:47,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:24:47,409 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:47" (1/1) ... [2025-03-17 05:24:47,428 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:47" (1/1) ... [2025-03-17 05:24:47,461 INFO L138 Inliner]: procedures = 36, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-03-17 05:24:47,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:47,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:24:47,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:24:47,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:24:47,470 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:47" (1/1) ... [2025-03-17 05:24:47,471 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:47" (1/1) ... [2025-03-17 05:24:47,481 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:47" (1/1) ... [2025-03-17 05:24:47,517 INFO L175 MemorySlicer]: Split 145 memory accesses to 5 slices as follows [2, 8, 49, 7, 79]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 1, 7]. The 18 writes are split as follows [0, 1, 7, 1, 9]. [2025-03-17 05:24:47,517 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:47" (1/1) ... [2025-03-17 05:24:47,517 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:47" (1/1) ... [2025-03-17 05:24:47,547 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:47" (1/1) ... [2025-03-17 05:24:47,548 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:47" (1/1) ... [2025-03-17 05:24:47,555 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:47" (1/1) ... [2025-03-17 05:24:47,557 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:47" (1/1) ... [2025-03-17 05:24:47,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:24:47,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:24:47,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:24:47,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:24:47,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:47" (1/1) ... [2025-03-17 05:24:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:47,592 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:47,594 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:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:24:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:24:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:24:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:24:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:24:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:24:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:24:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:24:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:24:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:24:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:24:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:24:47,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:24:47,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:24:49,903 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~mem101#1;havoc property_#t~ite120#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite117#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem126#1;havoc property_#t~ite136#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite156#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~short147#1;havoc property_#t~ite153#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite152#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem155#1;havoc property_#t~mem154#1;havoc property_#t~short157#1; [2025-03-17 05:24:49,934 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-03-17 05:24:49,935 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:24:49,945 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:24:49,946 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:24:49,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:49 BoogieIcfgContainer [2025-03-17 05:24:49,947 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:24:49,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:24:49,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:24:49,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:24:49,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:24:47" (1/3) ... [2025-03-17 05:24:49,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a2542f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:49, skipping insertion in model container [2025-03-17 05:24:49,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:47" (2/3) ... [2025-03-17 05:24:49,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a2542f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:49, skipping insertion in model container [2025-03-17 05:24:49,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:49" (3/3) ... [2025-03-17 05:24:49,956 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-51.i [2025-03-17 05:24:49,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:24:49,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-51.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:24:50,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:24:50,031 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;@7adc2185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:24:50,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:24:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:24:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:24:50,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:50,049 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:50,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:50,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1506384424, now seen corresponding path program 1 times [2025-03-17 05:24:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:50,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955291455] [2025-03-17 05:24:50,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:50,062 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,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:50,065 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:50,067 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:50,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:50,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:50,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:50,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:50,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:24:50,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:24:50,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:50,432 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:50,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955291455] [2025-03-17 05:24:50,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955291455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:50,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:50,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:24:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406387930] [2025-03-17 05:24:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:50,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:24:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:50,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:24:50,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:50,457 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:24:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:50,482 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2025-03-17 05:24:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:24:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2025-03-17 05:24:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:50,489 INFO L225 Difference]: With dead ends: 233 [2025-03-17 05:24:50,489 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:24:50,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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:50,494 INFO L435 NwaCegarLoop]: 172 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, 172 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:50,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 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:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:24:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:24:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:24:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2025-03-17 05:24:50,543 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 145 [2025-03-17 05:24:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:50,543 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2025-03-17 05:24:50,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:24:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2025-03-17 05:24:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:24:50,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:50,547 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:50,556 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:50,748 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:50,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:50,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 6204215, now seen corresponding path program 1 times [2025-03-17 05:24:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:50,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805853841] [2025-03-17 05:24:50,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:50,750 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,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:50,753 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:50,754 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:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:24:51,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:24:51,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:51,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:24:51,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:51,274 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 29 treesize of output 22 [2025-03-17 05:24:51,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:51,313 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 43 treesize of output 13 [2025-03-17 05:24:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:24:51,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:24:51,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805853841] [2025-03-17 05:24:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805853841] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-17 05:24:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871141173] [2025-03-17 05:24:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:51,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:24:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:51,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:24:51,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:51,483 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:24:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:51,518 INFO L93 Difference]: Finished difference Result 231 states and 343 transitions. [2025-03-17 05:24:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:24:51,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2025-03-17 05:24:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:51,521 INFO L225 Difference]: With dead ends: 231 [2025-03-17 05:24:51,521 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:24:51,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:51,522 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:51,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:24:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:24:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:24:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2025-03-17 05:24:51,540 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 145 [2025-03-17 05:24:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2025-03-17 05:24:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:24:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2025-03-17 05:24:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:24:51,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:51,543 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:51,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:24:51,744 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:51,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:51,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 996550129, now seen corresponding path program 1 times [2025-03-17 05:24:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736539473] [2025-03-17 05:24:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:51,747 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:51,760 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:51,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:24:52,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:24:52,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:52,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:52,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:24:52,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:52,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-03-17 05:24:52,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:52,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 163 treesize of output 67 [2025-03-17 05:24:53,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:53,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 163 treesize of output 67 [2025-03-17 05:24:55,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:55,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 210 treesize of output 108 [2025-03-17 05:24:55,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:55,443 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 418 treesize of output 142 [2025-03-17 05:24:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-03-17 05:24:55,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:55,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736539473] [2025-03-17 05:24:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736539473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [720864262] [2025-03-17 05:24:55,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:55,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:55,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:24:55,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:24:55,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 05:24:56,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:24:57,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:24:57,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:57,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:57,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:24:57,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:57,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:24:58,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:58,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 79 [2025-03-17 05:25:02,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:02,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 91 [2025-03-17 05:25:04,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:04,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 128 [2025-03-17 05:25:04,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:04,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 324 treesize of output 156 [2025-03-17 05:25:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 60 proven. 192 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-17 05:25:04,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [720864262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:05,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:25:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2025-03-17 05:25:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995133357] [2025-03-17 05:25:05,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:25:05,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:25:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:05,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:25:05,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=314, Unknown=1, NotChecked=0, Total=380 [2025-03-17 05:25:05,138 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 16 states have internal predecessors, (111), 5 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2025-03-17 05:25:09,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:16,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:23,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:27,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:30,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:33,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:25:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:53,366 INFO L93 Difference]: Finished difference Result 398 states and 580 transitions. [2025-03-17 05:25:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:25:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 16 states have internal predecessors, (111), 5 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) Word has length 147 [2025-03-17 05:25:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:53,369 INFO L225 Difference]: With dead ends: 398 [2025-03-17 05:25:53,369 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 05:25:53,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 312 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=150, Invalid=601, Unknown=5, NotChecked=0, Total=756 [2025-03-17 05:25:53,371 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 726 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 120 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:53,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1566 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 900 Invalid, 6 Unknown, 0 Unchecked, 32.8s Time] [2025-03-17 05:25:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 05:25:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 277. [2025-03-17 05:25:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 231 states have (on average 1.3982683982683983) internal successors, (323), 233 states have internal predecessors, (323), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:25:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 405 transitions. [2025-03-17 05:25:53,399 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 405 transitions. Word has length 147 [2025-03-17 05:25:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:53,399 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 405 transitions. [2025-03-17 05:25:53,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 16 states have internal predecessors, (111), 5 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2025-03-17 05:25:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 405 transitions. [2025-03-17 05:25:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:25:53,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:53,402 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:53,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:25:53,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-17 05:25:53,802 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:25:53,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:53,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1470069072, now seen corresponding path program 1 times [2025-03-17 05:25:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246071726] [2025-03-17 05:25:53,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:53,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:53,826 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:53,827 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:53,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:25:54,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:25:54,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:54,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:54,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:25:54,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-03-17 05:25:54,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:54,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246071726] [2025-03-17 05:25:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246071726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705175435] [2025-03-17 05:25:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:54,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:54,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:54,049 INFO L87 Difference]: Start difference. First operand 277 states and 405 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:25:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:54,123 INFO L93 Difference]: Finished difference Result 553 states and 809 transitions. [2025-03-17 05:25:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2025-03-17 05:25:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:54,126 INFO L225 Difference]: With dead ends: 553 [2025-03-17 05:25:54,126 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 05:25:54,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:54,127 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:54,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 05:25:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-17 05:25:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 231 states have (on average 1.393939393939394) internal successors, (322), 233 states have internal predecessors, (322), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:25:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 404 transitions. [2025-03-17 05:25:54,152 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 404 transitions. Word has length 147 [2025-03-17 05:25:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:54,152 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 404 transitions. [2025-03-17 05:25:54,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:25:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 404 transitions. [2025-03-17 05:25:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:25:54,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:54,154 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:54,163 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 (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:54,358 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:54,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:54,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1470113619, now seen corresponding path program 1 times [2025-03-17 05:25:54,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:54,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448783168] [2025-03-17 05:25:54,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:54,359 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:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:54,363 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:54,363 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:54,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:25:54,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:25:54,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:54,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:54,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:25:54,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:54,825 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:55,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:55,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 77 [2025-03-17 05:25:58,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:58,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 151 treesize of output 103 [2025-03-17 05:26:08,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:08,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 228 treesize of output 150 [2025-03-17 05:26:08,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:08,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 436 treesize of output 148 [2025-03-17 05:26:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 71 proven. 237 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-17 05:26:08,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:26:08,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448783168] [2025-03-17 05:26:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448783168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [878576102] [2025-03-17 05:26:08,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:08,892 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:26:08,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:26:08,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:26:08,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-17 05:26:09,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:26:10,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:26:10,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:10,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:10,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 05:26:10,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:10,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:26:20,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:20,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 69