./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.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-73.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 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:27:21,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:27:22,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:27:22,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:27:22,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:27:22,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:27:22,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:27:22,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:27:22,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:27:22,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:27:22,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:27:22,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:27:22,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:27:22,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:27:22,075 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:27:22,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:27:22,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:27:22,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:27:22,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:27:22,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:27:22,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:27:22,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:27:22,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:27:22,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:27:22,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:27:22,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:22,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:27:22,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:27:22,078 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 -> 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 [2025-03-17 05:27:22,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:27:22,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:27:22,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:27:22,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:27:22,353 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:27:22,355 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-73.i [2025-03-17 05:27:23,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a31f344b/affd0f0653a245c78a6d5181b99f443d/FLAG5c87a9334 [2025-03-17 05:27:23,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:27:23,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2025-03-17 05:27:23,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a31f344b/affd0f0653a245c78a6d5181b99f443d/FLAG5c87a9334 [2025-03-17 05:27:23,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a31f344b/affd0f0653a245c78a6d5181b99f443d [2025-03-17 05:27:23,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:27:23,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:27:23,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:23,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:27:23,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:27:23,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1329c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:23, skipping insertion in model container [2025-03-17 05:27:23,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:23" (1/1) ... [2025-03-17 05:27:23,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:27:24,070 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-73.i[916,929] [2025-03-17 05:27:24,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:24,129 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:27:24,140 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-73.i[916,929] [2025-03-17 05:27:24,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:24,187 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:27:24,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24 WrapperNode [2025-03-17 05:27:24,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:24,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:24,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:27:24,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:27:24,193 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:27:24" (1/1) ... [2025-03-17 05:27:24,203 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:27:24" (1/1) ... [2025-03-17 05:27:24,237 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2025-03-17 05:27:24,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:24,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:27:24,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:27:24,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:27:24,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,270 INFO L175 MemorySlicer]: Split 134 memory accesses to 7 slices as follows [2, 22, 17, 32, 9, 9, 43]. 32 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 1, 3]. The 19 writes are split as follows [0, 3, 3, 6, 2, 1, 4]. [2025-03-17 05:27:24,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:27:24,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:27:24,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:27:24,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:27:24,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (1/1) ... [2025-03-17 05:27:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:24,322 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:27:24,324 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:27:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:27:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:27:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:27:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:27:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:27:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:27:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:27:24,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:27:24,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:27:24,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:27:24,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:27:24,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:27:24,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:27:24,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:27:24,483 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:27:24,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:27:24,873 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-17 05:27:24,909 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 05:27:24,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:27:24,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:27:24,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:27:24,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:24 BoogieIcfgContainer [2025-03-17 05:27:24,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:27:24,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:27:24,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:27:24,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:27:24,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:27:23" (1/3) ... [2025-03-17 05:27:24,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728b92d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:27:24, skipping insertion in model container [2025-03-17 05:27:24,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:24" (2/3) ... [2025-03-17 05:27:24,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728b92d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:27:24, skipping insertion in model container [2025-03-17 05:27:24,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:24" (3/3) ... [2025-03-17 05:27:24,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-73.i [2025-03-17 05:27:24,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:27:24,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-73.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:27:24,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:27:25,006 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;@7078666a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:27:25,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:27:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:27:25,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:25,019 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:25,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:25,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash 264884909, now seen corresponding path program 1 times [2025-03-17 05:27:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:25,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080373154] [2025-03-17 05:27:25,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:25,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:25,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:25,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:27:25,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080373154] [2025-03-17 05:27:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080373154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004643284] [2025-03-17 05:27:25,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:25,340 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:27:25,342 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:27:25,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:25,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:25,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:25,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:25,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:27:25,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:27:25,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004643284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:27:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536837878] [2025-03-17 05:27:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:25,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:27:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:25,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:27:25,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:27:25,640 INFO L87 Difference]: Start difference. First operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:25,660 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2025-03-17 05:27:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:27:25,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-17 05:27:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:25,667 INFO L225 Difference]: With dead ends: 203 [2025-03-17 05:27:25,667 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 05:27:25,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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:27:25,671 INFO L435 NwaCegarLoop]: 150 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, 150 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:27:25,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 05:27:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 05:27:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-17 05:27:25,709 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 124 [2025-03-17 05:27:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:25,710 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 05:27:25,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-17 05:27:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:27:25,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:25,713 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:25,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:27:25,913 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:27:25,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1423781618, now seen corresponding path program 1 times [2025-03-17 05:27:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:25,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694172067] [2025-03-17 05:27:25,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:25,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:26,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:26,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:26,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:27:26,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:26,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694172067] [2025-03-17 05:27:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694172067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:26,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744786112] [2025-03-17 05:27:26,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:26,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:26,385 INFO L229 MonitoredProcess]: Starting monitored process 3 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:27:26,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:27:26,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:26,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:26,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:26,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:26,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:26,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:26,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744786112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:27:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136569708] [2025-03-17 05:27:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:26,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:26,625 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:26,667 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2025-03-17 05:27:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 05:27:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:26,670 INFO L225 Difference]: With dead ends: 204 [2025-03-17 05:27:26,670 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:27:26,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:26,671 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:26,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:27:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 05:27:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-03-17 05:27:26,683 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 124 [2025-03-17 05:27:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:26,685 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-03-17 05:27:26,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-03-17 05:27:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:27:26,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:26,688 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:26,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:27:26,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 05:27:26,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:26,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash -536277937, now seen corresponding path program 1 times [2025-03-17 05:27:26,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:26,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515829274] [2025-03-17 05:27:26,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:26,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:26,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:26,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:26,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:27:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515829274] [2025-03-17 05:27:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515829274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714375454] [2025-03-17 05:27:27,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:27,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:27,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:27,118 INFO L229 MonitoredProcess]: Starting monitored process 4 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:27:27,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:27:27,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:27,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:27,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:27,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:27,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:27,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:27,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714375454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:27,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:27:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526562051] [2025-03-17 05:27:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:27,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:27,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:27,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:27,313 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:27,347 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2025-03-17 05:27:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 05:27:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:27,349 INFO L225 Difference]: With dead ends: 208 [2025-03-17 05:27:27,350 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:27:27,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:27:27,351 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:27,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:27:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 05:27:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 88 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2025-03-17 05:27:27,363 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 124 [2025-03-17 05:27:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:27,367 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-03-17 05:27:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2025-03-17 05:27:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:27:27,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:27,369 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:27,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:27:27,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:27,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:27,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash -535354416, now seen corresponding path program 1 times [2025-03-17 05:27:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145314904] [2025-03-17 05:27:27,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:27,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:27,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:27,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:27,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:27:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:27,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145314904] [2025-03-17 05:27:27,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145314904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:27:27,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265302286] [2025-03-17 05:27:27,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:27,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:27,752 INFO L229 MonitoredProcess]: Starting monitored process 5 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:27:27,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:27:27,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:27,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:27,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:27,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:27,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:27,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:27,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:27,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265302286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:27,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:27:27,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:27:27,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500642980] [2025-03-17 05:27:27,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:27,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:27,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:27,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:27,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:27,938 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:27,962 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-03-17 05:27:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 05:27:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:27,963 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:27:27,964 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:27:27,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:27,964 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:27,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:27:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 05:27:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 05:27:27,975 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 124 [2025-03-17 05:27:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:27,976 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 05:27:27,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 05:27:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:27:27,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:27,979 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:27,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:27:28,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:27:28,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash -32335026, now seen corresponding path program 1 times [2025-03-17 05:27:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:28,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995895662] [2025-03-17 05:27:28,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:28,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:27:28,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:27:28,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:28,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995895662] [2025-03-17 05:27:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995895662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:28,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400714120] [2025-03-17 05:27:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:28,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:27:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:28,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:27:28,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:28,681 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:28,868 INFO L93 Difference]: Finished difference Result 321 states and 469 transitions. [2025-03-17 05:27:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:27:28,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-17 05:27:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:28,870 INFO L225 Difference]: With dead ends: 321 [2025-03-17 05:27:28,870 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 05:27:28,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:28,871 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 102 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:28,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 419 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:27:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 05:27:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2025-03-17 05:27:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 176 states have internal predecessors, (246), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:27:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 306 transitions. [2025-03-17 05:27:28,886 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 306 transitions. Word has length 126 [2025-03-17 05:27:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:28,886 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 306 transitions. [2025-03-17 05:27:28,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 306 transitions. [2025-03-17 05:27:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:27:28,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:28,888 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:27:28,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash -441159251, now seen corresponding path program 1 times [2025-03-17 05:27:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:28,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085441555] [2025-03-17 05:27:28,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:28,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:27:28,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:27:28,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:28,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:29,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:29,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085441555] [2025-03-17 05:27:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085441555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:29,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:27:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195359778] [2025-03-17 05:27:29,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:27:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:29,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:27:29,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:29,451 INFO L87 Difference]: Start difference. First operand 209 states and 306 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:29,850 INFO L93 Difference]: Finished difference Result 480 states and 702 transitions. [2025-03-17 05:27:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:27:29,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-17 05:27:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:29,852 INFO L225 Difference]: With dead ends: 480 [2025-03-17 05:27:29,852 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 05:27:29,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:27:29,853 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 180 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:29,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 785 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:27:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 05:27:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 207. [2025-03-17 05:27:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.396551724137931) internal successors, (243), 174 states have internal predecessors, (243), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:27:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 303 transitions. [2025-03-17 05:27:29,870 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 303 transitions. Word has length 126 [2025-03-17 05:27:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:29,871 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 303 transitions. [2025-03-17 05:27:29,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 303 transitions. [2025-03-17 05:27:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:27:29,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:29,872 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:29,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:27:29,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:29,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 523107090, now seen corresponding path program 1 times [2025-03-17 05:27:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419287181] [2025-03-17 05:27:29,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:29,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:27:29,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:27:29,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:29,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419287181] [2025-03-17 05:27:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419287181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:27:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148012520] [2025-03-17 05:27:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:30,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:30,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:30,446 INFO L87 Difference]: Start difference. First operand 207 states and 303 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:30,823 INFO L93 Difference]: Finished difference Result 476 states and 696 transitions. [2025-03-17 05:27:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:27:30,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-17 05:27:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:30,826 INFO L225 Difference]: With dead ends: 476 [2025-03-17 05:27:30,826 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 05:27:30,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:30,828 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 180 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:30,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 618 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:27:30,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 05:27:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 207. [2025-03-17 05:27:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3908045977011494) internal successors, (242), 174 states have internal predecessors, (242), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:27:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 302 transitions. [2025-03-17 05:27:30,846 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 302 transitions. Word has length 127 [2025-03-17 05:27:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:30,847 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 302 transitions. [2025-03-17 05:27:30,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 302 transitions. [2025-03-17 05:27:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:27:30,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:30,848 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:30,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:27:30,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:30,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash 734458003, now seen corresponding path program 1 times [2025-03-17 05:27:30,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:30,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391767992] [2025-03-17 05:27:30,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:30,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:30,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:27:30,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:27:30,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:30,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:27:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391767992] [2025-03-17 05:27:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391767992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:27:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590223640] [2025-03-17 05:27:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:27:31,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:31,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:31,358 INFO L87 Difference]: Start difference. First operand 207 states and 302 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:31,708 INFO L93 Difference]: Finished difference Result 476 states and 694 transitions. [2025-03-17 05:27:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:27:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-17 05:27:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:31,711 INFO L225 Difference]: With dead ends: 476 [2025-03-17 05:27:31,711 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 05:27:31,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:27:31,713 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 174 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:31,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 620 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:27:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 05:27:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 207. [2025-03-17 05:27:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3850574712643677) internal successors, (241), 174 states have internal predecessors, (241), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:27:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 301 transitions. [2025-03-17 05:27:31,728 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 301 transitions. Word has length 127 [2025-03-17 05:27:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:31,729 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 301 transitions. [2025-03-17 05:27:31,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 301 transitions. [2025-03-17 05:27:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:27:31,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:31,731 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:31,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:27:31,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:31,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash 223923826, now seen corresponding path program 1 times [2025-03-17 05:27:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:27:31,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441963302] [2025-03-17 05:27:31,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:27:31,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:27:31,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:27:31,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:31,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:27:31,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:27:31,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:27:31,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:27:31,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:31,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:27:31,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:27:31,911 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:27:31,912 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:27:31,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:27:31,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:31,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:27:31,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:27:31 BoogieIcfgContainer [2025-03-17 05:27:31,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:27:31,988 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:27:31,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:27:31,988 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:27:31,989 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:24" (3/4) ... [2025-03-17 05:27:31,991 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:27:31,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:27:31,993 INFO L158 Benchmark]: Toolchain (without parser) took 8086.80ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 121.6MB in the beginning and 132.6MB in the end (delta: -11.0MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2025-03-17 05:27:31,993 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:27:31,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.26ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 106.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:27:31,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.56ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 102.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:27:31,993 INFO L158 Benchmark]: Boogie Preprocessor took 56.54ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 98.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:27:31,994 INFO L158 Benchmark]: IcfgBuilder took 624.86ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 64.6MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:27:31,994 INFO L158 Benchmark]: TraceAbstraction took 7065.97ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 63.7MB in the beginning and 132.7MB in the end (delta: -68.9MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-03-17 05:27:31,994 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 276.8MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:27:31,995 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.30ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.26ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 106.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.56ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 102.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.54ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 98.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 624.86ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 64.6MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7065.97ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 63.7MB in the beginning and 132.7MB in the end (delta: -68.9MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 276.8MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -16 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L40] float last_1_float_Array_0_0_ = 15.75; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR float_Array_0[0] [L102] last_1_float_Array_0_0_ = float_Array_0[0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L76] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] float_Array_0[1] = __VERIFIER_nondet_float() [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] float_Array_0[2] = __VERIFIER_nondet_float() [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L44] BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L44] COND FALSE !(BOOL_unsigned_char_Array_0[2]) [L47] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L47] COND FALSE !(last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) [L51] EXPR unsigned_char_Array_0[1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[1] [L52] EXPR signed_long_int_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L52] COND FALSE !(signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) [L63] EXPR float_Array_0[1] [L63] float_Array_0[0] = float_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L65] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR signed_long_int_Array_0[0] [L65] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L65] signed long int stepLocal_0 = (((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))); [L66] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L66] COND TRUE unsigned_char_Array_0[1] <= stepLocal_0 [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L67] COND TRUE ! BOOL_unsigned_char_Array_0[2] [L68] EXPR double_Array_0[0] [L68] double_Array_0[1] = double_Array_0[0] [L73] EXPR signed_char_Array_0[1] [L73] signed_char_Array_0[0] = signed_char_Array_0[1] [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0])) [L105] EXPR double_Array_0[1] [L105] EXPR double_Array_0[0] [L105] EXPR (! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105-L106] return (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 169 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 3888 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2599 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1289 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 199 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1625 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1486 ConstructedInterpolants, 0 QuantifiedInterpolants, 3216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1801 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 4886/5040 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:27:32,020 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-73.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 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:27:34,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:27:34,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:27:34,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:27:34,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:27:34,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:27:34,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:27:34,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:27:34,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:27:34,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:27:34,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:27:34,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:27:34,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:27:34,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:27:34,313 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:27:34,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:27:34,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:27:34,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:27:34,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:27:34,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:27:34,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:27:34,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:27:34,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:34,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:27:34,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:27:34,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:27:34,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:27:34,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:27:34,317 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 -> 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 [2025-03-17 05:27:34,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:27:34,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:27:34,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:27:34,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:27:34,611 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:27:34,613 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-73.i [2025-03-17 05:27:35,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c7996bb/56b5acaa96a943c484cd0718e50663cd/FLAGd2d2412a4 [2025-03-17 05:27:36,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:27:36,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2025-03-17 05:27:36,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c7996bb/56b5acaa96a943c484cd0718e50663cd/FLAGd2d2412a4 [2025-03-17 05:27:36,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c7996bb/56b5acaa96a943c484cd0718e50663cd [2025-03-17 05:27:36,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:27:36,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:27:36,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:36,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:27:36,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:27:36,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19efd144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36, skipping insertion in model container [2025-03-17 05:27:36,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:27:36,569 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-73.i[916,929] [2025-03-17 05:27:36,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:36,630 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:27:36,643 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-73.i[916,929] [2025-03-17 05:27:36,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:27:36,690 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:27:36,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36 WrapperNode [2025-03-17 05:27:36,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:27:36,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:36,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:27:36,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:27:36,696 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:27:36" (1/1) ... [2025-03-17 05:27:36,707 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:27:36" (1/1) ... [2025-03-17 05:27:36,736 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2025-03-17 05:27:36,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:27:36,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:27:36,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:27:36,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:27:36,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,797 INFO L175 MemorySlicer]: Split 134 memory accesses to 7 slices as follows [2, 22, 17, 32, 9, 9, 43]. 32 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 1, 3]. The 19 writes are split as follows [0, 3, 3, 6, 2, 1, 4]. [2025-03-17 05:27:36,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:27:36,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:27:36,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:27:36,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:27:36,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (1/1) ... [2025-03-17 05:27:36,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:27:36,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:27:36,902 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:27:36,905 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:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:27:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:27:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:27:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:27:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:27:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:27:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:27:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:27:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:27:36,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:27:36,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:27:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:27:36,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:27:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:27:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:27:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:27:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:27:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:27:36,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:27:36,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:27:37,083 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:27:37,085 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:27:38,981 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-17 05:27:39,022 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 05:27:39,024 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:27:39,035 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:27:39,036 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:27:39,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:39 BoogieIcfgContainer [2025-03-17 05:27:39,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:27:39,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:27:39,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:27:39,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:27:39,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:27:36" (1/3) ... [2025-03-17 05:27:39,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e99e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:27:39, skipping insertion in model container [2025-03-17 05:27:39,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:27:36" (2/3) ... [2025-03-17 05:27:39,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e99e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:27:39, skipping insertion in model container [2025-03-17 05:27:39,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:27:39" (3/3) ... [2025-03-17 05:27:39,046 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-73.i [2025-03-17 05:27:39,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:27:39,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-73.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:27:39,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:27:39,113 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;@14ccb38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:27:39,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:27:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:27:39,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:39,125 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:39,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:39,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:39,129 INFO L85 PathProgramCache]: Analyzing trace with hash 264884909, now seen corresponding path program 1 times [2025-03-17 05:27:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68743249] [2025-03-17 05:27:39,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:39,138 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:27:39,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:39,140 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:27:39,142 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:27:39,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:39,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:39,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:39,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:39,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:27:39,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 05:27:39,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:39,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68743249] [2025-03-17 05:27:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68743249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:39,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:27:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145051443] [2025-03-17 05:27:39,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:39,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:27:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:39,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:27:39,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:27:39,605 INFO L87 Difference]: Start difference. First operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:39,647 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2025-03-17 05:27:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:27:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-17 05:27:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:39,656 INFO L225 Difference]: With dead ends: 203 [2025-03-17 05:27:39,656 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 05:27:39,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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:27:39,661 INFO L435 NwaCegarLoop]: 150 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, 150 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:27:39,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 05:27:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 05:27:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-17 05:27:39,696 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 124 [2025-03-17 05:27:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:39,696 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 05:27:39,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-17 05:27:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:27:39,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:39,700 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:39,711 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:27:39,901 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:27:39,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:39,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1423781618, now seen corresponding path program 1 times [2025-03-17 05:27:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:39,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866466672] [2025-03-17 05:27:39,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:39,904 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:27:39,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:39,906 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:27:39,908 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:27:40,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:27:40,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:27:40,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:40,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:40,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:27:40,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:40,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:40,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866466672] [2025-03-17 05:27:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866466672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:40,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:27:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327938538] [2025-03-17 05:27:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:40,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:40,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:40,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:27:40,304 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:40,362 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2025-03-17 05:27:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 05:27:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:40,368 INFO L225 Difference]: With dead ends: 203 [2025-03-17 05:27:40,368 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 05:27:40,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 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:27:40,369 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:40,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:27:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 05:27:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 05:27:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-03-17 05:27:40,381 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 124 [2025-03-17 05:27:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:40,383 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-03-17 05:27:40,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-03-17 05:27:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:27:40,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:40,386 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:40,399 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:27:40,587 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:27:40,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash -920762228, now seen corresponding path program 1 times [2025-03-17 05:27:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697323098] [2025-03-17 05:27:40,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:40,589 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:27:40,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:40,591 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:27:40,592 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:27:40,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:27:40,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:27:40,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:40,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:40,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:27:40,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:40,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:40,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697323098] [2025-03-17 05:27:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697323098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:40,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:40,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:40,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980274859] [2025-03-17 05:27:40,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:40,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:27:40,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:40,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:27:40,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:40,989 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:41,073 INFO L93 Difference]: Finished difference Result 210 states and 310 transitions. [2025-03-17 05:27:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:27:41,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-17 05:27:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:41,077 INFO L225 Difference]: With dead ends: 210 [2025-03-17 05:27:41,078 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:27:41,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:41,080 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:41,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 564 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:27:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:27:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-17 05:27:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 05:27:41,095 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 126 [2025-03-17 05:27:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:41,097 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 05:27:41,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 05:27:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:27:41,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:41,100 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:41,120 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:27:41,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:27:41,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -33258547, now seen corresponding path program 1 times [2025-03-17 05:27:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:41,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125754793] [2025-03-17 05:27:41,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:41,302 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:27:41,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:41,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:27:41,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:27:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:27:41,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:27:41,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:41,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:41,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:27:41,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:41,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:41,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:41,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125754793] [2025-03-17 05:27:41,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125754793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:41,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:41,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:27:41,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809698851] [2025-03-17 05:27:41,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:41,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:41,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:41,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:41,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:41,663 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:41,736 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-03-17 05:27:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:27:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-17 05:27:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:41,738 INFO L225 Difference]: With dead ends: 216 [2025-03-17 05:27:41,738 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:27:41,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:41,740 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:41,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 699 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:27:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:27:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 05:27:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2025-03-17 05:27:41,750 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 126 [2025-03-17 05:27:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:41,751 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2025-03-17 05:27:41,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2025-03-17 05:27:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:27:41,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:41,754 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:41,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:27:41,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:27:41,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:41,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash -32335026, now seen corresponding path program 1 times [2025-03-17 05:27:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915186447] [2025-03-17 05:27:41,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:41,956 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:27:41,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:41,958 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:27:41,959 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:27:42,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:27:42,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:27:42,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:42,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:42,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:27:42,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:42,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 05:27:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-17 05:27:42,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:42,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:42,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915186447] [2025-03-17 05:27:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915186447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:42,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890623033] [2025-03-17 05:27:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:42,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:42,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:42,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:42,619 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:46,327 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2025-03-17 05:27:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:27:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-03-17 05:27:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:46,329 INFO L225 Difference]: With dead ends: 218 [2025-03-17 05:27:46,329 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:27:46,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:27:46,330 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 121 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:46,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 469 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-17 05:27:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:27:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 05:27:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-17 05:27:46,341 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 126 [2025-03-17 05:27:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-17 05:27:46,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-17 05:27:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:27:46,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:46,347 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:46,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:27:46,551 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:27:46,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -741619476, now seen corresponding path program 1 times [2025-03-17 05:27:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353029141] [2025-03-17 05:27:46,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:46,552 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:27:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:46,554 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:27:46,556 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:27:46,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:27:46,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:27:46,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:46,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:46,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:27:46,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:47,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 05:27:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-17 05:27:47,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:47,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353029141] [2025-03-17 05:27:47,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353029141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:47,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:47,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940661054] [2025-03-17 05:27:47,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:47,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:47,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:47,047 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:48,995 INFO L93 Difference]: Finished difference Result 218 states and 314 transitions. [2025-03-17 05:27:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:27:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-03-17 05:27:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:48,997 INFO L225 Difference]: With dead ends: 218 [2025-03-17 05:27:48,997 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:27:48,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:27:48,997 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 112 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:48,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 464 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 05:27:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:27:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 05:27:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-17 05:27:49,005 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 128 [2025-03-17 05:27:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:49,006 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-17 05:27:49,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:27:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-17 05:27:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:27:49,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:49,007 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:49,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:27:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:27:49,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:49,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash -680283954, now seen corresponding path program 1 times [2025-03-17 05:27:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676860630] [2025-03-17 05:27:49,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:49,214 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:27:49,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:49,216 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:27:49,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:27:49,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:27:49,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:27:49,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:49,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:49,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:27:49,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:49,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 05:27:49,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2025-03-17 05:27:49,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:27:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:49,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:49,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676860630] [2025-03-17 05:27:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676860630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:27:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861583715] [2025-03-17 05:27:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:49,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:27:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:49,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:27:49,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:27:49,695 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:52,073 INFO L93 Difference]: Finished difference Result 274 states and 393 transitions. [2025-03-17 05:27:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:27:52,074 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:27:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:52,075 INFO L225 Difference]: With dead ends: 274 [2025-03-17 05:27:52,075 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 05:27:52,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:52,076 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 140 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:52,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 471 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 05:27:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 05:27:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-17 05:27:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-03-17 05:27:52,095 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 130 [2025-03-17 05:27:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:52,096 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-03-17 05:27:52,096 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-03-17 05:27:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:27:52,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:52,097 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:52,111 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 (8)] Ended with exit code 0 [2025-03-17 05:27:52,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:27:52,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:52,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1089108179, now seen corresponding path program 1 times [2025-03-17 05:27:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:52,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840068880] [2025-03-17 05:27:52,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:52,299 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:27:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:52,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:27:52,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:27:52,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:27:52,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:27:52,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:52,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:52,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:27:52,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:52,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 05:27:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:52,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:52,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:52,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840068880] [2025-03-17 05:27:52,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840068880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:52,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:52,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:27:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013853946] [2025-03-17 05:27:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:52,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:52,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:52,828 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:54,680 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2025-03-17 05:27:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:27:54,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:27:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:54,682 INFO L225 Difference]: With dead ends: 274 [2025-03-17 05:27:54,682 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 05:27:54,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:54,683 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 136 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:54,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 595 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 05:27:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 05:27:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-17 05:27:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2025-03-17 05:27:54,692 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 130 [2025-03-17 05:27:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:54,692 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2025-03-17 05:27:54,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2025-03-17 05:27:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:27:54,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:54,693 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:54,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 05:27:54,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:27:54,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2122877715, now seen corresponding path program 1 times [2025-03-17 05:27:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679110522] [2025-03-17 05:27:54,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:54,898 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:27:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:54,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:27:54,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:27:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:27:55,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:27:55,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:55,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:55,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:27:55,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:55,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 05:27:55,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2025-03-17 05:27:55,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:27:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:27:55,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:55,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679110522] [2025-03-17 05:27:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679110522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:55,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103537166] [2025-03-17 05:27:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:55,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:27:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:55,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:27:55,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:27:55,460 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:57,856 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2025-03-17 05:27:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:27:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-17 05:27:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:57,857 INFO L225 Difference]: With dead ends: 274 [2025-03-17 05:27:57,857 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 05:27:57,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:57,858 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 133 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:57,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 624 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 05:27:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 05:27:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-17 05:27:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:27:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2025-03-17 05:27:57,869 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 131 [2025-03-17 05:27:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:57,869 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2025-03-17 05:27:57,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:27:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2025-03-17 05:27:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:27:57,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:57,871 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:57,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 05:27:58,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:27:58,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:58,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1612343538, now seen corresponding path program 1 times [2025-03-17 05:27:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700026025] [2025-03-17 05:27:58,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:58,072 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:27:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:58,074 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:27:58,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:27:58,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:27:58,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:27:58,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:58,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:58,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:27:58,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:58,706 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:27:59,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:27:59,792 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 172 treesize of output 98 [2025-03-17 05:28:00,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:28:00,014 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 368 treesize of output 134 [2025-03-17 05:28:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 05:28:00,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:28:00,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700026025] [2025-03-17 05:28:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700026025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:28:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1470015652] [2025-03-17 05:28:00,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:00,530 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:28:00,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:28:00,532 INFO L229 MonitoredProcess]: Starting monitored process 12 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:28:00,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-17 05:28:00,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:28:01,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:28:01,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:01,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:28:01,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:02,245 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:28:05,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:28:05,135 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 166 treesize of output 100 [2025-03-17 05:28:05,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:28:05,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 326 treesize of output 142 [2025-03-17 05:28:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 05:28:05,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:28:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1470015652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:28:05,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:28:05,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-17 05:28:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173714102] [2025-03-17 05:28:05,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:28:05,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:28:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:05,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:28:05,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:28:05,646 INFO L87 Difference]: Start difference. First operand 109 states and 153 transitions. Second operand has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 16 states have internal predecessors, (111), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-17 05:28:17,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:28:20,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:28:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:22,816 INFO L93 Difference]: Finished difference Result 337 states and 472 transitions. [2025-03-17 05:28:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:28:22,817 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), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 131 [2025-03-17 05:28:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:22,818 INFO L225 Difference]: With dead ends: 337 [2025-03-17 05:28:22,818 INFO L226 Difference]: Without dead ends: 229 [2025-03-17 05:28:22,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:28:22,820 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 286 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:28:22,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1718 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 863 Invalid, 1 Unknown, 0 Unchecked, 16.4s Time] [2025-03-17 05:28:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-17 05:28:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2025-03-17 05:28:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 185 states have internal predecessors, (242), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:28:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 314 transitions. [2025-03-17 05:28:22,838 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 314 transitions. Word has length 131 [2025-03-17 05:28:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:22,838 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 314 transitions. [2025-03-17 05:28:22,839 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), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-17 05:28:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 314 transitions. [2025-03-17 05:28:22,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:28:22,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:22,840 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:22,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:28:23,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-17 05:28:23,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:28:23,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:23,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1170589043, now seen corresponding path program 1 times [2025-03-17 05:28:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:23,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035782060] [2025-03-17 05:28:23,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:23,242 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:28:23,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:23,244 INFO L229 MonitoredProcess]: Starting monitored process 13 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:28:23,246 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 (13)] Waiting until timeout for monitored process [2025-03-17 05:28:23,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:28:23,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:28:23,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:23,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:23,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:28:23,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 05:28:23,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:28:23,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035782060] [2025-03-17 05:28:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035782060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:28:23,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:28:23,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:28:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029305180] [2025-03-17 05:28:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:28:23,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:28:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:28:23,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:28:23,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:28:23,565 INFO L87 Difference]: Start difference. First operand 223 states and 314 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:28:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:28:23,642 INFO L93 Difference]: Finished difference Result 433 states and 609 transitions. [2025-03-17 05:28:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:28:23,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-17 05:28:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:28:23,646 INFO L225 Difference]: With dead ends: 433 [2025-03-17 05:28:23,646 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 05:28:23,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 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:28:23,647 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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:28:23,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:28:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 05:28:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-17 05:28:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 183 states have (on average 1.3169398907103824) internal successors, (241), 185 states have internal predecessors, (241), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:28:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 313 transitions. [2025-03-17 05:28:23,665 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 313 transitions. Word has length 131 [2025-03-17 05:28:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:28:23,665 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 313 transitions. [2025-03-17 05:28:23,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:28:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 313 transitions. [2025-03-17 05:28:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:28:23,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:28:23,668 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:23,678 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 (13)] Ended with exit code 0 [2025-03-17 05:28:23,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:28:23,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:28:23,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:28:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1980130512, now seen corresponding path program 1 times [2025-03-17 05:28:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:28:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204096939] [2025-03-17 05:28:23,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:23,870 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:28:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:28:23,872 INFO L229 MonitoredProcess]: Starting monitored process 14 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:28:23,873 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 (14)] Waiting until timeout for monitored process [2025-03-17 05:28:23,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:28:24,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:28:24,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:24,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:24,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 05:28:24,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:24,521 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 18 treesize of output 19 [2025-03-17 05:28:30,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:28:30,460 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 188 treesize of output 104 [2025-03-17 05:28:30,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:28:30,727 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 339 treesize of output 149 [2025-03-17 05:28:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 05:28:30,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:28:31,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:28:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204096939] [2025-03-17 05:28:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204096939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:28:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [154636292] [2025-03-17 05:28:31,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:28:31,146 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:28:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:28:31,151 INFO L229 MonitoredProcess]: Starting monitored process 15 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:28:31,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-17 05:28:31,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:28:32,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:28:32,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:28:32,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:28:32,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 05:28:32,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:28:36,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2025-03-17 05:28:41,299 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