./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-p_file-47.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 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:28:57,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:28:57,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:28:57,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:28:57,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:28:57,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:28:57,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:28:57,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:28:57,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:28:57,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:28:57,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:28:57,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:28:57,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:28:57,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:28:57,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:28:57,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:28:57,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:28:57,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:28:57,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:28:57,105 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2025-03-04 01:28:57,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:28:57,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:28:57,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:28:57,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:28:57,329 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:28:57,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-04 01:28:58,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5593bfd6e/7b7e870a134347ac890cf389dff2e063/FLAG0b097549f [2025-03-04 01:28:58,720 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:28:58,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-04 01:28:58,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5593bfd6e/7b7e870a134347ac890cf389dff2e063/FLAG0b097549f [2025-03-04 01:28:59,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5593bfd6e/7b7e870a134347ac890cf389dff2e063 [2025-03-04 01:28:59,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:28:59,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:28:59,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:28:59,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:28:59,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:28:59,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59, skipping insertion in model container [2025-03-04 01:28:59,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:28:59,142 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-p_file-47.i[916,929] [2025-03-04 01:28:59,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:28:59,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:28:59,211 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-p_file-47.i[916,929] [2025-03-04 01:28:59,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:28:59,254 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:28:59,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59 WrapperNode [2025-03-04 01:28:59,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:28:59,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:28:59,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:28:59,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:28:59,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,289 INFO L138 Inliner]: procedures = 29, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2025-03-04 01:28:59,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:28:59,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:28:59,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:28:59,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:28:59,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,315 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2025-03-04 01:28:59,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:28:59,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:28:59,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:28:59,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:28:59,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (1/1) ... [2025-03-04 01:28:59,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:28:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:59,365 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-04 01:28:59,367 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-04 01:28:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:28:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:28:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:28:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:28:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:28:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:28:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:28:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:28:59,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:28:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:28:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:28:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:28:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:28:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:28:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:28:59,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:28:59,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:28:59,508 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:28:59,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:28:59,804 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:28:59,842 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-04 01:28:59,842 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:28:59,852 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:28:59,852 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:28:59,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:59 BoogieIcfgContainer [2025-03-04 01:28:59,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:28:59,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:28:59,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:28:59,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:28:59,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:28:59" (1/3) ... [2025-03-04 01:28:59,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6545c582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:59, skipping insertion in model container [2025-03-04 01:28:59,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:59" (2/3) ... [2025-03-04 01:28:59,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6545c582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:59, skipping insertion in model container [2025-03-04 01:28:59,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:59" (3/3) ... [2025-03-04 01:28:59,859 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2025-03-04 01:28:59,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:28:59,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:28:59,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:28:59,922 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;@44e9c838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:28:59,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:28:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:28:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:28:59,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:59,932 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:28:59,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:59,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-03-04 01:28:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839204357] [2025-03-04 01:28:59,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:00,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:00,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:00,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:00,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:29:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839204357] [2025-03-04 01:29:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839204357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:00,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144283120] [2025-03-04 01:29:00,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:00,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:29:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:29:00,149 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-04 01:29:00,151 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-04 01:29:00,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:00,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:00,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:00,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:00,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:29:00,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:29:00,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144283120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:00,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:29:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393761341] [2025-03-04 01:29:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:00,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:29:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:00,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:29:00,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:29:00,409 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:29:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:00,424 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-03-04 01:29:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:29:00,427 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-04 01:29:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:00,433 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:29:00,433 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:29:00,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-04 01:29:00,437 INFO L435 NwaCegarLoop]: 134 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, 134 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-04 01:29:00,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:29:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:29:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:29:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-03-04 01:29:00,468 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-03-04 01:29:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:00,469 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-03-04 01:29:00,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:29:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-03-04 01:29:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:00,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:00,472 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:00,479 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-04 01:29:00,673 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-04 01:29:00,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:00,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-03-04 01:29:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033061392] [2025-03-04 01:29:00,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:00,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:00,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:00,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:00,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033061392] [2025-03-04 01:29:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033061392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:00,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:00,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:29:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670656661] [2025-03-04 01:29:00,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:00,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:00,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:00,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:00,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:00,890 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:00,930 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2025-03-04 01:29:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:00,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:00,932 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:29:00,932 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:29:00,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-04 01:29:00,933 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:00,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:29:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-04 01:29:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:29:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-03-04 01:29:00,941 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 84 [2025-03-04 01:29:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:00,944 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-03-04 01:29:00,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-03-04 01:29:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:00,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:00,945 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:00,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:29:00,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:00,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-03-04 01:29:00,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:00,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653207086] [2025-03-04 01:29:00,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:00,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:00,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:00,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:00,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:00,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653207086] [2025-03-04 01:29:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653207086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:01,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573203479] [2025-03-04 01:29:01,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:01,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:01,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:01,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:01,313 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:01,518 INFO L93 Difference]: Finished difference Result 274 states and 399 transitions. [2025-03-04 01:29:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:29:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:01,521 INFO L225 Difference]: With dead ends: 274 [2025-03-04 01:29:01,521 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 01:29:01,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:29:01,522 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 122 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:01,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 433 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:29:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 01:29:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2025-03-04 01:29:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:29:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2025-03-04 01:29:01,540 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 84 [2025-03-04 01:29:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:01,540 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2025-03-04 01:29:01,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2025-03-04 01:29:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:01,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:01,542 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:01,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:29:01,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:01,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -562947685, now seen corresponding path program 1 times [2025-03-04 01:29:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346803145] [2025-03-04 01:29:01,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:01,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:01,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:01,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:01,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:01,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:29:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346803145] [2025-03-04 01:29:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346803145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653861892] [2025-03-04 01:29:01,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:29:01,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:29:01,710 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-04 01:29:01,712 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-04 01:29:01,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:01,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:01,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:01,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:01,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:01,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:01,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:01,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653861892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:01,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:01,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:29:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473376739] [2025-03-04 01:29:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:01,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:01,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:01,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:29:01,921 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:01,952 INFO L93 Difference]: Finished difference Result 344 states and 498 transitions. [2025-03-04 01:29:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:01,955 INFO L225 Difference]: With dead ends: 344 [2025-03-04 01:29:01,955 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 01:29:01,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:29:01,956 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:01,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 01:29:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-04 01:29:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3935483870967742) internal successors, (216), 155 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:29:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 252 transitions. [2025-03-04 01:29:01,971 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 252 transitions. Word has length 84 [2025-03-04 01:29:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:01,972 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 252 transitions. [2025-03-04 01:29:01,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 252 transitions. [2025-03-04 01:29:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:01,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:01,973 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:01,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:29:02,179 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,SelfDestructingSolverStorable3 [2025-03-04 01:29:02,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:02,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-03-04 01:29:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:02,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549860923] [2025-03-04 01:29:02,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:02,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:02,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:02,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:02,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:29:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549860923] [2025-03-04 01:29:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549860923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664505860] [2025-03-04 01:29:02,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:02,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:29:02,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:29:02,313 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-04 01:29:02,316 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-04 01:29:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:02,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:02,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:02,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:02,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:02,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:02,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664505860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:02,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:29:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788671929] [2025-03-04 01:29:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:02,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:02,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:02,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:29:02,529 INFO L87 Difference]: Start difference. First operand 176 states and 252 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:02,568 INFO L93 Difference]: Finished difference Result 355 states and 509 transitions. [2025-03-04 01:29:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:02,570 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:29:02,572 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 01:29:02,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:29:02,574 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:02,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 01:29:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2025-03-04 01:29:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 157 states have internal predecessors, (218), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:29:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2025-03-04 01:29:02,597 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 84 [2025-03-04 01:29:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:02,597 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2025-03-04 01:29:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2025-03-04 01:29:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:02,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:02,598 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:02,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:29:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:29:02,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-03-04 01:29:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494098155] [2025-03-04 01:29:02,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:02,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:02,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:02,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:02,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:29:02,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:29:02,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:02,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:02,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:02,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:29:02,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:29:02,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:29:02,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:29:02,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:29:02,954 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 01:29:03,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:29:03,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:29:03 BoogieIcfgContainer [2025-03-04 01:29:03,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:29:03,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:29:03,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:29:03,076 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:29:03,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:59" (3/4) ... [2025-03-04 01:29:03,081 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:29:03,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:29:03,082 INFO L158 Benchmark]: Toolchain (without parser) took 4059.75ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 123.6MB in the beginning and 237.2MB in the end (delta: -113.7MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2025-03-04 01:29:03,083 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:29:03,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.64ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 109.6MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:29:03,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.68ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:29:03,083 INFO L158 Benchmark]: Boogie Preprocessor took 43.15ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:29:03,083 INFO L158 Benchmark]: IcfgBuilder took 518.87ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 69.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:29:03,083 INFO L158 Benchmark]: TraceAbstraction took 3221.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 69.6MB in the beginning and 237.3MB in the end (delta: -167.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-04 01:29:03,084 INFO L158 Benchmark]: Witness Printer took 5.90ms. Allocated memory is still 352.3MB. Free memory was 237.3MB in the beginning and 237.2MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:29:03,085 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.15ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.64ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 109.6MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.68ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.15ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 518.87ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 69.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3221.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 69.6MB in the beginning and 237.3MB in the end (delta: -167.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 5.90ms. Allocated memory is still 352.3MB. Free memory was 237.3MB in the beginning and 237.2MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L22] double var_1_1 = 24.575; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] double var_1_8 = 3.5; [L24] double var_1_8 = 3.5; [L25] double* var_1_8_Pointer = &(var_1_8); [L26] signed char var_1_9 = 16; [L26] signed char var_1_9 = 16; [L27] signed char* var_1_9_Pointer = &(var_1_9); [L28] signed char var_1_10 = 16; [L28] signed char var_1_10 = 16; [L29] signed char* var_1_10_Pointer = &(var_1_10); [L30] signed char var_1_11 = 4; [L30] signed char var_1_11 = 4; [L31] signed char* var_1_11_Pointer = &(var_1_11); [L32] signed long int var_1_12 = 8; [L32] signed long int var_1_12 = 8; [L33] signed long int* var_1_12_Pointer = &(var_1_12); [L34] unsigned char var_1_13 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char* var_1_13_Pointer = &(var_1_13); [L36] unsigned char var_1_14 = 1; [L36] unsigned char var_1_14 = 1; [L37] unsigned char* var_1_14_Pointer = &(var_1_14); [L38] double var_1_15 = 3.8; [L38] double var_1_15 = 3.8; [L39] double* var_1_15_Pointer = &(var_1_15); [L40] signed long int last_1_var_1_12 = 8; VAL [isInitial=0, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L87] EXPR \read(var_1_12) [L87] last_1_var_1_12 = var_1_12 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L71] var_1_8 = __VERIFIER_nondet_double() [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] var_1_11 = __VERIFIER_nondet_char() [L77] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L98] RET updateVariables() [L99] CALL step() [L44] COND FALSE !(-4 > last_1_var_1_12) [L49] EXPR \read(*var_1_10_Pointer) [L49] (*(var_1_9_Pointer)) = (*(var_1_10_Pointer)) [L51] EXPR \read(*var_1_13_Pointer) [L51] unsigned char stepLocal_0 = ! (*(var_1_13_Pointer)); [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] stepLocal_0 || (*(var_1_14_Pointer)) [L52] EXPR \read(*var_1_14_Pointer) [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] COND FALSE !(stepLocal_0 || (*(var_1_14_Pointer))) [L59] EXPR \read(*var_1_8_Pointer) [L59] (*(var_1_15_Pointer)) = (*(var_1_8_Pointer)) [L60] EXPR \read(*var_1_15_Pointer) [L60] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L60] COND FALSE !((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L65] COND TRUE (*(var_1_12_Pointer)) > (*(var_1_9_Pointer)) [L66] EXPR \read(*var_1_8_Pointer) [L66] (*(var_1_1_Pointer)) = (*(var_1_8_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_15_Pointer) [L90] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90-L91] return (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 1974 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1321 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 653 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=5, InterpolantAutomatonStates: 22, 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, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1146 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 1118/1152 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-04 01:29:03,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.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 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:29:05,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:29:05,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:29:05,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:29:05,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:29:05,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:29:05,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:29:05,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:29:05,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:29:05,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:29:05,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:29:05,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:29:05,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:29:05,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:29:05,244 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:29:05,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:29:05,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:29:05,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:29:05,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:29:05,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:29:05,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:29:05,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:29:05,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:29:05,248 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2025-03-04 01:29:05,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:29:05,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:29:05,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:29:05,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:29:05,521 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:29:05,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-04 01:29:06,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263e3fc55/f9f85da20e724cbb8f91c1bc9b568704/FLAGa3fc01841 [2025-03-04 01:29:06,988 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:29:06,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-04 01:29:06,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263e3fc55/f9f85da20e724cbb8f91c1bc9b568704/FLAGa3fc01841 [2025-03-04 01:29:07,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263e3fc55/f9f85da20e724cbb8f91c1bc9b568704 [2025-03-04 01:29:07,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:29:07,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:29:07,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:29:07,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:29:07,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:29:07,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3464adfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07, skipping insertion in model container [2025-03-04 01:29:07,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:29:07,497 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-p_file-47.i[916,929] [2025-03-04 01:29:07,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:29:07,556 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:29:07,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i[916,929] [2025-03-04 01:29:07,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:29:07,596 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:29:07,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07 WrapperNode [2025-03-04 01:29:07,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:29:07,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:29:07,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:29:07,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:29:07,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,637 INFO L138 Inliner]: procedures = 33, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2025-03-04 01:29:07,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:29:07,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:29:07,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:29:07,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:29:07,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,677 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2025-03-04 01:29:07,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:29:07,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:29:07,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:29:07,711 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:29:07,712 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (1/1) ... [2025-03-04 01:29:07,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:29:07,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:29:07,738 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-04 01:29:07,745 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-04 01:29:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:29:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:29:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:29:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:29:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:29:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:29:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:29:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:29:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:29:07,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:29:07,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 01:29:07,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-04 01:29:07,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-04 01:29:07,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:29:07,956 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:29:08,400 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:29:08,429 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-04 01:29:08,429 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:29:08,437 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:29:08,438 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:29:08,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:29:08 BoogieIcfgContainer [2025-03-04 01:29:08,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:29:08,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:29:08,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:29:08,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:29:08,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:29:07" (1/3) ... [2025-03-04 01:29:08,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5f5bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:29:08, skipping insertion in model container [2025-03-04 01:29:08,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:07" (2/3) ... [2025-03-04 01:29:08,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5f5bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:29:08, skipping insertion in model container [2025-03-04 01:29:08,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:29:08" (3/3) ... [2025-03-04 01:29:08,446 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2025-03-04 01:29:08,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:29:08,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:29:08,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:29:08,533 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;@7ed7e358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:29:08,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:29:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:29:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:08,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:08,543 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:08,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:08,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-03-04 01:29:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823470583] [2025-03-04 01:29:08,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:08,560 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-04 01:29:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:08,564 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-04 01:29:08,565 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-04 01:29:08,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:08,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:08,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:29:08,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 01:29:08,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:08,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823470583] [2025-03-04 01:29:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823470583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:08,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:29:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764807136] [2025-03-04 01:29:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:29:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:08,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:29:08,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:29:08,915 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:29:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:08,936 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-03-04 01:29:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:29:08,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-04 01:29:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:08,943 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:29:08,943 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:29:08,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-04 01:29:08,947 INFO L435 NwaCegarLoop]: 134 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, 134 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-04 01:29:08,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:29:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:29:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:29:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-03-04 01:29:08,976 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-03-04 01:29:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:08,976 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-03-04 01:29:08,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:29:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-03-04 01:29:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:08,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:08,981 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:08,988 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-04 01:29:09,182 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-04 01:29:09,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-03-04 01:29:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247797796] [2025-03-04 01:29:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:09,184 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-04 01:29:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:09,187 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-04 01:29:09,188 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-04 01:29:09,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:09,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:09,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:09,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:09,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:09,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:09,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:09,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247797796] [2025-03-04 01:29:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247797796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203488705] [2025-03-04 01:29:09,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:09,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:09,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:09,489 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:09,555 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2025-03-04 01:29:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:09,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:09,557 INFO L225 Difference]: With dead ends: 186 [2025-03-04 01:29:09,557 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:29:09,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-04 01:29:09,558 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:09,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:29:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-04 01:29:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:29:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-04 01:29:09,571 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2025-03-04 01:29:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:09,572 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-04 01:29:09,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-04 01:29:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:09,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:09,575 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:09,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:29:09,775 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-04 01:29:09,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-03-04 01:29:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620482538] [2025-03-04 01:29:09,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:09,777 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-04 01:29:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:09,779 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-04 01:29:09,780 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-04 01:29:09,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:10,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:10,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:10,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:29:10,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:10,621 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 27 treesize of output 19 [2025-03-04 01:29:10,630 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 13 treesize of output 9 [2025-03-04 01:29:10,872 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 30 treesize of output 18 [2025-03-04 01:29:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:29:10,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:11,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:11,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 01:29:11,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:11,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620482538] [2025-03-04 01:29:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620482538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:11,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1009378273] [2025-03-04 01:29:11,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:29:11,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:29:11,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-04 01:29:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:12,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:12,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:12,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:12,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:29:12,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:12,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:12,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 58 [2025-03-04 01:29:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:12,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1009378273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:12,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:12,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-03-04 01:29:12,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197510732] [2025-03-04 01:29:12,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:12,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:12,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:12,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:29:12,550 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:12,762 INFO L93 Difference]: Finished difference Result 275 states and 396 transitions. [2025-03-04 01:29:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:12,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:12,764 INFO L225 Difference]: With dead ends: 275 [2025-03-04 01:29:12,764 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 01:29:12,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:29:12,765 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:12,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 482 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:29:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 01:29:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 98. [2025-03-04 01:29:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:29:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-04 01:29:12,775 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2025-03-04 01:29:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:12,775 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-04 01:29:12,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-04 01:29:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:12,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:12,776 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:12,784 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-04 01:29:12,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-04 01:29:13,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:13,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:13,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-03-04 01:29:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:13,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929810891] [2025-03-04 01:29:13,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:13,181 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-04 01:29:13,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:13,182 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-04 01:29:13,183 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-04 01:29:13,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:13,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:13,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:13,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:13,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:13,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:13,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:13,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929810891] [2025-03-04 01:29:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929810891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:13,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:13,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097386181] [2025-03-04 01:29:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:13,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:13,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:13,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:13,377 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:13,398 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-03-04 01:29:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:13,400 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:29:13,400 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:29:13,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-04 01:29:13,401 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:13,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:29:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:29:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:29:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-04 01:29:13,406 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 84 [2025-03-04 01:29:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:13,406 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-04 01:29:13,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-04 01:29:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:13,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:13,407 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:13,413 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-04 01:29:13,608 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-04 01:29:13,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:13,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-03-04 01:29:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393346470] [2025-03-04 01:29:13,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:13,609 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-04 01:29:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:13,611 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-04 01:29:13,613 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-04 01:29:13,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:13,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:13,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:13,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:13,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:29:13,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:14,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:14,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 62 [2025-03-04 01:29:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:14,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:14,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:14,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393346470] [2025-03-04 01:29:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393346470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:14,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:14,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:29:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816581169] [2025-03-04 01:29:14,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:14,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:29:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:14,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:29:14,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:29:14,730 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:15,416 INFO L93 Difference]: Finished difference Result 289 states and 410 transitions. [2025-03-04 01:29:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:29:15,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:15,418 INFO L225 Difference]: With dead ends: 289 [2025-03-04 01:29:15,418 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 01:29:15,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:29:15,419 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 309 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:15,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 615 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:29:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 01:29:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2025-03-04 01:29:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:29:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2025-03-04 01:29:15,431 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 84 [2025-03-04 01:29:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:15,432 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2025-03-04 01:29:15,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2025-03-04 01:29:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:29:15,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:15,437 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:15,446 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-04 01:29:15,637 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-04 01:29:15,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:15,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 911590556, now seen corresponding path program 1 times [2025-03-04 01:29:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788118913] [2025-03-04 01:29:15,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:15,639 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-04 01:29:15,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:15,640 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-04 01:29:15,641 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-04 01:29:15,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:29:15,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:29:15,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:15,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:15,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:29:15,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:15,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:15,823 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:15,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788118913] [2025-03-04 01:29:15,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788118913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:15,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:15,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:29:15,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508749151] [2025-03-04 01:29:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:15,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:15,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:15,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:15,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:15,824 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:15,873 INFO L93 Difference]: Finished difference Result 283 states and 405 transitions. [2025-03-04 01:29:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:29:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:15,874 INFO L225 Difference]: With dead ends: 283 [2025-03-04 01:29:15,874 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 01:29:15,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-04 01:29:15,875 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:15,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 01:29:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-04 01:29:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:29:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2025-03-04 01:29:15,893 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 84 [2025-03-04 01:29:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:15,893 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2025-03-04 01:29:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2025-03-04 01:29:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:29:15,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:15,894 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:15,902 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-04 01:29:16,094 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-04 01:29:16,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:16,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -158299719, now seen corresponding path program 1 times [2025-03-04 01:29:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677624684] [2025-03-04 01:29:16,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:16,096 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-04 01:29:16,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:16,098 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-04 01:29:16,100 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-04 01:29:16,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:29:16,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:29:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:16,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:16,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:29:16,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:17,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:17,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 60 [2025-03-04 01:29:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:29:18,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:18,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677624684] [2025-03-04 01:29:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677624684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [156744000] [2025-03-04 01:29:18,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:18,867 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:29:18,872 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:29:18,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:29:19,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:29:19,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:29:19,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:19,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:19,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:29:19,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:19,881 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-04 01:29:25,333 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 21 treesize of output 10 [2025-03-04 01:29:25,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 68 [2025-03-04 01:29:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:29:25,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:26,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [156744000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:26,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:29:26,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2025-03-04 01:29:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644080551] [2025-03-04 01:29:26,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:29:26,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:29:26,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:26,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:29:26,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2025-03-04 01:29:26,305 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. Second operand has 21 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:29:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:27,802 INFO L93 Difference]: Finished difference Result 378 states and 533 transitions. [2025-03-04 01:29:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:29:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 86 [2025-03-04 01:29:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:27,805 INFO L225 Difference]: With dead ends: 378 [2025-03-04 01:29:27,805 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 01:29:27,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=228, Invalid=1103, Unknown=1, NotChecked=0, Total=1332 [2025-03-04 01:29:27,806 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 792 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:27,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 994 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:29:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 01:29:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 169. [2025-03-04 01:29:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 138 states have internal predecessors, (182), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:29:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 236 transitions. [2025-03-04 01:29:27,836 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 236 transitions. Word has length 86 [2025-03-04 01:29:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:27,836 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 236 transitions. [2025-03-04 01:29:27,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:29:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 236 transitions. [2025-03-04 01:29:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:29:27,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:27,838 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:27,848 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-04 01:29:28,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:29:28,238 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:28,239 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:28,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 261217112, now seen corresponding path program 1 times [2025-03-04 01:29:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976766385] [2025-03-04 01:29:28,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:28,239 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-04 01:29:28,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:28,241 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-04 01:29:28,242 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-04 01:29:28,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:29:28,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:29:28,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:28,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:28,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:29:28,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:29:28,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:28,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976766385] [2025-03-04 01:29:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976766385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:28,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:28,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:29:28,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981684765] [2025-03-04 01:29:28,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:28,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:29:28,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:28,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:29:28,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:28,452 INFO L87 Difference]: Start difference. First operand 169 states and 236 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:29:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:28,554 INFO L93 Difference]: Finished difference Result 299 states and 411 transitions. [2025-03-04 01:29:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:29:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-04 01:29:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:28,557 INFO L225 Difference]: With dead ends: 299 [2025-03-04 01:29:28,557 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:29:28,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:29:28,558 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:28,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 553 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:29:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:29:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2025-03-04 01:29:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.297029702970297) internal successors, (131), 102 states have internal predecessors, (131), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:29:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2025-03-04 01:29:28,568 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 86 [2025-03-04 01:29:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2025-03-04 01:29:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:29:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2025-03-04 01:29:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:29:28,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:28,569 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:28,577 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-04 01:29:28,769 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 [2025-03-04 01:29:28,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1352803434, now seen corresponding path program 1 times [2025-03-04 01:29:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336088929] [2025-03-04 01:29:28,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:28,770 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-04 01:29:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:28,772 INFO L229 MonitoredProcess]: Starting monitored process 12 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-04 01:29:28,773 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 (12)] Waiting until timeout for monitored process [2025-03-04 01:29:28,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:29:28,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:29:28,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:28,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:28,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 01:29:28,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:29,478 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 24 [2025-03-04 01:29:29,481 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 13 treesize of output 9 [2025-03-04 01:29:29,676 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 30 treesize of output 18 [2025-03-04 01:29:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 01:29:29,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:29,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336088929] [2025-03-04 01:29:29,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336088929] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:29,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:29,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-04 01:29:29,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824296974] [2025-03-04 01:29:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:29,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:29,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:29,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:29,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:29:29,939 INFO L87 Difference]: Start difference. First operand 123 states and 167 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:30,272 INFO L93 Difference]: Finished difference Result 356 states and 486 transitions. [2025-03-04 01:29:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2025-03-04 01:29:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:30,275 INFO L225 Difference]: With dead ends: 356 [2025-03-04 01:29:30,275 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 01:29:30,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:29:30,275 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 114 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:30,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 420 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:29:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 01:29:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2025-03-04 01:29:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 181 states have (on average 1.281767955801105) internal successors, (232), 183 states have internal predecessors, (232), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:29:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 304 transitions. [2025-03-04 01:29:30,297 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 304 transitions. Word has length 86 [2025-03-04 01:29:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:30,297 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 304 transitions. [2025-03-04 01:29:30,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 304 transitions. [2025-03-04 01:29:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:29:30,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:30,300 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:30,309 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 (12)] Ended with exit code 0 [2025-03-04 01:29:30,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-04 01:29:30,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:30,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1246894764, now seen corresponding path program 1 times [2025-03-04 01:29:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:30,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792575073] [2025-03-04 01:29:30,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:30,501 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-04 01:29:30,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:30,503 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-04 01:29:30,504 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-04 01:29:30,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:29:30,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:29:30,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:30,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:30,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:29:30,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:31,119 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 17 treesize of output 13 [2025-03-04 01:29:31,323 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 66 treesize of output 50 [2025-03-04 01:29:31,325 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 68 treesize of output 44 [2025-03-04 01:29:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:29:31,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:31,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792575073] [2025-03-04 01:29:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792575073] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:31,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:31,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2025-03-04 01:29:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887494588] [2025-03-04 01:29:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:31,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:29:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:31,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:29:31,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:29:31,579 INFO L87 Difference]: Start difference. First operand 224 states and 304 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:32,097 INFO L93 Difference]: Finished difference Result 655 states and 877 transitions. [2025-03-04 01:29:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:29:32,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2025-03-04 01:29:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:32,100 INFO L225 Difference]: With dead ends: 655 [2025-03-04 01:29:32,100 INFO L226 Difference]: Without dead ends: 434 [2025-03-04 01:29:32,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:29:32,101 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 240 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:32,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 666 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:29:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-04 01:29:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 358. [2025-03-04 01:29:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 311 states have (on average 1.3183279742765273) internal successors, (410), 315 states have internal predecessors, (410), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:29:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 486 transitions. [2025-03-04 01:29:32,138 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 486 transitions. Word has length 86 [2025-03-04 01:29:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:32,140 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 486 transitions. [2025-03-04 01:29:32,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 486 transitions. [2025-03-04 01:29:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 01:29:32,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:32,141 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:32,149 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-04 01:29:32,342 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-04 01:29:32,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:32,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash -13769633, now seen corresponding path program 1 times [2025-03-04 01:29:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446465550] [2025-03-04 01:29:32,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:32,343 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-04 01:29:32,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:32,345 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-04 01:29:32,346 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-04 01:29:32,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 01:29:32,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 01:29:32,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:32,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:32,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:29:32,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:32,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:32,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446465550] [2025-03-04 01:29:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446465550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:32,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:29:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920307548] [2025-03-04 01:29:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:32,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:32,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:32,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:32,589 INFO L87 Difference]: Start difference. First operand 358 states and 486 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:32,710 INFO L93 Difference]: Finished difference Result 994 states and 1339 transitions. [2025-03-04 01:29:32,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:32,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2025-03-04 01:29:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:32,722 INFO L225 Difference]: With dead ends: 994 [2025-03-04 01:29:32,722 INFO L226 Difference]: Without dead ends: 639 [2025-03-04 01:29:32,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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-04 01:29:32,724 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 217 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:32,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 346 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:29:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-04 01:29:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 475. [2025-03-04 01:29:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 417 states have (on average 1.3045563549160673) internal successors, (544), 421 states have internal predecessors, (544), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:29:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 638 transitions. [2025-03-04 01:29:32,756 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 638 transitions. Word has length 87 [2025-03-04 01:29:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:32,757 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 638 transitions. [2025-03-04 01:29:32,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 638 transitions. [2025-03-04 01:29:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 01:29:32,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:32,758 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:32,764 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 (14)] Ended with exit code 0 [2025-03-04 01:29:32,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-04 01:29:32,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 573669108, now seen corresponding path program 1 times [2025-03-04 01:29:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676181659] [2025-03-04 01:29:32,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:32,959 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-04 01:29:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:32,961 INFO L229 MonitoredProcess]: Starting monitored process 15 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-04 01:29:32,963 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 (15)] Waiting until timeout for monitored process [2025-03-04 01:29:33,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 01:29:33,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 01:29:33,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:33,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:33,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:29:33,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:34,739 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-04 01:29:34,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:34,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2025-03-04 01:29:34,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:34,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 79 [2025-03-04 01:29:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:35,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:35,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:35,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676181659] [2025-03-04 01:29:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676181659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:29:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230947642] [2025-03-04 01:29:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:29:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:35,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:29:35,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:29:35,277 INFO L87 Difference]: Start difference. First operand 475 states and 638 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:37,818 INFO L93 Difference]: Finished difference Result 1375 states and 1850 transitions. [2025-03-04 01:29:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 01:29:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2025-03-04 01:29:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:37,823 INFO L225 Difference]: With dead ends: 1375 [2025-03-04 01:29:37,823 INFO L226 Difference]: Without dead ends: 903 [2025-03-04 01:29:37,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:29:37,825 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 380 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:37,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1556 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:29:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-03-04 01:29:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 603. [2025-03-04 01:29:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 534 states have (on average 1.3202247191011236) internal successors, (705), 536 states have internal predecessors, (705), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:29:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 817 transitions. [2025-03-04 01:29:37,870 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 817 transitions. Word has length 88 [2025-03-04 01:29:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 817 transitions. [2025-03-04 01:29:37,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 817 transitions. [2025-03-04 01:29:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 01:29:37,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:37,871 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:37,883 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 (15)] Ended with exit code 0 [2025-03-04 01:29:38,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-04 01:29:38,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:38,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash 280266101, now seen corresponding path program 1 times [2025-03-04 01:29:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286564686] [2025-03-04 01:29:38,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:38,073 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-04 01:29:38,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:38,076 INFO L229 MonitoredProcess]: Starting monitored process 16 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-04 01:29:38,080 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 (16)] Waiting until timeout for monitored process [2025-03-04 01:29:38,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 01:29:38,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 01:29:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:38,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 01:29:38,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:38,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:38,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 36 [2025-03-04 01:29:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:39,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:39,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286564686] [2025-03-04 01:29:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286564686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:29:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388318655] [2025-03-04 01:29:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:39,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:29:39,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:39,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:29:39,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:29:39,029 INFO L87 Difference]: Start difference. First operand 603 states and 817 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:39,601 INFO L93 Difference]: Finished difference Result 1395 states and 1884 transitions. [2025-03-04 01:29:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:29:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2025-03-04 01:29:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:39,608 INFO L225 Difference]: With dead ends: 1395 [2025-03-04 01:29:39,608 INFO L226 Difference]: Without dead ends: 795 [2025-03-04 01:29:39,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:29:39,611 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 286 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:39,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 567 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:29:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-04 01:29:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 603. [2025-03-04 01:29:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 534 states have (on average 1.3108614232209739) internal successors, (700), 536 states have internal predecessors, (700), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:29:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 812 transitions. [2025-03-04 01:29:39,647 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 812 transitions. Word has length 88 [2025-03-04 01:29:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:39,647 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 812 transitions. [2025-03-04 01:29:39,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 812 transitions. [2025-03-04 01:29:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 01:29:39,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:39,649 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:39,656 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 (16)] Ended with exit code 0 [2025-03-04 01:29:39,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-04 01:29:39,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:39,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1830212767, now seen corresponding path program 1 times [2025-03-04 01:29:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754888961] [2025-03-04 01:29:39,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:39,851 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-04 01:29:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:39,854 INFO L229 MonitoredProcess]: Starting monitored process 17 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-04 01:29:39,856 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 (17)] Waiting until timeout for monitored process [2025-03-04 01:29:39,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 01:29:40,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 01:29:40,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:40,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:40,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:29:40,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:40,724 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 18 treesize of output 19 [2025-03-04 01:29:41,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:41,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 133 [2025-03-04 01:29:41,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:41,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 135 [2025-03-04 01:29:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:41,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:41,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754888961] [2025-03-04 01:29:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754888961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:41,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:29:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728493390] [2025-03-04 01:29:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:41,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:29:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:41,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:29:41,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:29:41,431 INFO L87 Difference]: Start difference. First operand 603 states and 812 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:42,708 INFO L93 Difference]: Finished difference Result 812 states and 1086 transitions. [2025-03-04 01:29:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:29:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-04 01:29:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:42,711 INFO L225 Difference]: With dead ends: 812 [2025-03-04 01:29:42,711 INFO L226 Difference]: Without dead ends: 810 [2025-03-04 01:29:42,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:29:42,712 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 283 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:42,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 955 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:29:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-04 01:29:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 770. [2025-03-04 01:29:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 701 states have (on average 1.3181169757489302) internal successors, (924), 703 states have internal predecessors, (924), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:29:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1036 transitions. [2025-03-04 01:29:42,747 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1036 transitions. Word has length 89 [2025-03-04 01:29:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1036 transitions. [2025-03-04 01:29:42,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1036 transitions. [2025-03-04 01:29:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 01:29:42,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:42,749 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:42,756 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 (17)] Ended with exit code 0 [2025-03-04 01:29:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-04 01:29:42,949 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1831136288, now seen corresponding path program 1 times [2025-03-04 01:29:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495241355] [2025-03-04 01:29:42,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:42,950 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-04 01:29:42,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:42,952 INFO L229 MonitoredProcess]: Starting monitored process 18 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-04 01:29:42,953 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 (18)] Waiting until timeout for monitored process [2025-03-04 01:29:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 01:29:43,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 01:29:43,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:43,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:43,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:43,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:29:43,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:43,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:43,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495241355] [2025-03-04 01:29:43,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495241355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:43,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90710266] [2025-03-04 01:29:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:43,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:43,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:43,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:43,156 INFO L87 Difference]: Start difference. First operand 770 states and 1036 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:43,204 INFO L93 Difference]: Finished difference Result 1567 states and 2109 transitions. [2025-03-04 01:29:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:43,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-04 01:29:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:43,207 INFO L225 Difference]: With dead ends: 1567 [2025-03-04 01:29:43,207 INFO L226 Difference]: Without dead ends: 800 [2025-03-04 01:29:43,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-04 01:29:43,209 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:43,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-04 01:29:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-03-04 01:29:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 731 states have (on average 1.305061559507524) internal successors, (954), 733 states have internal predecessors, (954), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:29:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1066 transitions. [2025-03-04 01:29:43,242 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1066 transitions. Word has length 89 [2025-03-04 01:29:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:43,243 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1066 transitions. [2025-03-04 01:29:43,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:29:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1066 transitions. [2025-03-04 01:29:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:29:43,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:43,244 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:43,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-03-04 01:29:43,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-04 01:29:43,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:43,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1231665326, now seen corresponding path program 1 times [2025-03-04 01:29:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739122589] [2025-03-04 01:29:43,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:43,446 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-04 01:29:43,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:43,448 INFO L229 MonitoredProcess]: Starting monitored process 19 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-04 01:29:43,450 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 (19)] Waiting until timeout for monitored process [2025-03-04 01:29:43,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:29:43,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:29:43,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:43,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:43,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:29:43,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:44,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:44,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 54 [2025-03-04 01:29:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:29:44,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:45,610 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2025-03-04 01:29:45,611 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 149 treesize of output 92 [2025-03-04 01:29:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:29:53,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:53,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739122589] [2025-03-04 01:29:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739122589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:29:53,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:29:53,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 01:29:53,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18911427] [2025-03-04 01:29:53,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:29:53,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:29:53,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:53,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:29:53,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2025-03-04 01:29:53,179 INFO L87 Difference]: Start difference. First operand 800 states and 1066 transitions. Second operand has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:29:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:54,769 INFO L93 Difference]: Finished difference Result 1649 states and 2185 transitions. [2025-03-04 01:29:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:29:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 90 [2025-03-04 01:29:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:54,772 INFO L225 Difference]: With dead ends: 1649 [2025-03-04 01:29:54,772 INFO L226 Difference]: Without dead ends: 852 [2025-03-04 01:29:54,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=234, Invalid=757, Unknown=1, NotChecked=0, Total=992 [2025-03-04 01:29:54,775 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 270 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:54,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1787 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:29:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-03-04 01:29:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 800. [2025-03-04 01:29:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 731 states have (on average 1.2968536251709986) internal successors, (948), 733 states have internal predecessors, (948), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:29:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1060 transitions. [2025-03-04 01:29:54,808 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1060 transitions. Word has length 90 [2025-03-04 01:29:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:54,808 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1060 transitions. [2025-03-04 01:29:54,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.0) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:29:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1060 transitions. [2025-03-04 01:29:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:29:54,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:54,811 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:54,819 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 (19)] Ended with exit code 0 [2025-03-04 01:29:55,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-04 01:29:55,012 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:55,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2066229617, now seen corresponding path program 1 times [2025-03-04 01:29:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:55,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138551519] [2025-03-04 01:29:55,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:55,012 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-04 01:29:55,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:55,014 INFO L229 MonitoredProcess]: Starting monitored process 20 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-04 01:29:55,015 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 (20)] Waiting until timeout for monitored process [2025-03-04 01:29:55,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:29:55,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:29:55,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:55,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:55,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:29:55,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:56,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:56,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 54 [2025-03-04 01:29:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:29:56,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:57,621 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2025-03-04 01:29:57,621 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 149 treesize of output 92 [2025-03-04 01:30:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:30:04,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:04,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138551519] [2025-03-04 01:30:04,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138551519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:30:04,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:30:04,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 01:30:04,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356673749] [2025-03-04 01:30:04,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:30:04,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:30:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:04,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:30:04,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2025-03-04 01:30:04,586 INFO L87 Difference]: Start difference. First operand 800 states and 1060 transitions. Second operand has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:30:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:06,035 INFO L93 Difference]: Finished difference Result 1649 states and 2173 transitions. [2025-03-04 01:30:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:30:06,036 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 90 [2025-03-04 01:30:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:06,039 INFO L225 Difference]: With dead ends: 1649 [2025-03-04 01:30:06,039 INFO L226 Difference]: Without dead ends: 852 [2025-03-04 01:30:06,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=234, Invalid=757, Unknown=1, NotChecked=0, Total=992 [2025-03-04 01:30:06,041 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 651 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:06,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1611 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:30:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-03-04 01:30:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 800. [2025-03-04 01:30:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 731 states have (on average 1.2900136798905608) internal successors, (943), 733 states have internal predecessors, (943), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:30:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1055 transitions. [2025-03-04 01:30:06,076 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1055 transitions. Word has length 90 [2025-03-04 01:30:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:06,076 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1055 transitions. [2025-03-04 01:30:06,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:30:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1055 transitions. [2025-03-04 01:30:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:30:06,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:06,078 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:06,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2025-03-04 01:30:06,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-04 01:30:06,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:06,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1772826610, now seen corresponding path program 1 times [2025-03-04 01:30:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751035954] [2025-03-04 01:30:06,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:06,279 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-04 01:30:06,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:06,285 INFO L229 MonitoredProcess]: Starting monitored process 21 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-04 01:30:06,286 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 (21)] Waiting until timeout for monitored process [2025-03-04 01:30:06,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:30:06,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:30:06,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:06,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:30:06,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:07,328 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-04 01:30:07,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:30:07,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2025-03-04 01:30:07,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:30:07,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 75 [2025-03-04 01:30:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:30:07,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:08,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751035954] [2025-03-04 01:30:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751035954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1949557405] [2025-03-04 01:30:08,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:30:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:30:08,102 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:30:08,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2025-03-04 01:30:08,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:30:09,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:30:09,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:09,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:09,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 01:30:09,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:09,292 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-04 01:30:16,450 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-04 01:30:16,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:30:16,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 24 [2025-03-04 01:30:16,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 83 [2025-03-04 01:30:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:30:21,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1949557405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:21,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:30:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2025-03-04 01:30:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733610881] [2025-03-04 01:30:21,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:30:21,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 01:30:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:21,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 01:30:21,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1179, Unknown=2, NotChecked=0, Total=1332 [2025-03-04 01:30:21,198 INFO L87 Difference]: Start difference. First operand 800 states and 1055 transitions. Second operand has 30 states, 28 states have (on average 3.25) internal successors, (91), 27 states have internal predecessors, (91), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:30:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:25,526 INFO L93 Difference]: Finished difference Result 1721 states and 2256 transitions. [2025-03-04 01:30:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 01:30:25,528 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.25) internal successors, (91), 27 states have internal predecessors, (91), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 90 [2025-03-04 01:30:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:25,531 INFO L225 Difference]: With dead ends: 1721 [2025-03-04 01:30:25,531 INFO L226 Difference]: Without dead ends: 924 [2025-03-04 01:30:25,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=474, Invalid=3064, Unknown=2, NotChecked=0, Total=3540 [2025-03-04 01:30:25,533 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 474 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:25,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 2677 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 01:30:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-04 01:30:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 777. [2025-03-04 01:30:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 708 states have (on average 1.2923728813559323) internal successors, (915), 710 states have internal predecessors, (915), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:30:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1027 transitions. [2025-03-04 01:30:25,575 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1027 transitions. Word has length 90 [2025-03-04 01:30:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:25,576 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1027 transitions. [2025-03-04 01:30:25,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.25) internal successors, (91), 27 states have internal predecessors, (91), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:30:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1027 transitions. [2025-03-04 01:30:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 01:30:25,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:25,577 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:25,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2025-03-04 01:30:25,785 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 (21)] Ended with exit code 0 [2025-03-04 01:30:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /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-04 01:30:25,978 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1699420161, now seen corresponding path program 1 times [2025-03-04 01:30:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609079751] [2025-03-04 01:30:25,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:25,978 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-04 01:30:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:25,980 INFO L229 MonitoredProcess]: Starting monitored process 23 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-04 01:30:25,981 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 (23)] Waiting until timeout for monitored process [2025-03-04 01:30:26,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:30:26,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:30:26,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:26,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:26,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:30:26,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:27,086 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-04 01:30:27,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:30:27,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 118 [2025-03-04 01:30:27,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:30:27,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 133 [2025-03-04 01:30:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:30:27,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:27,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609079751] [2025-03-04 01:30:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609079751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1667262521] [2025-03-04 01:30:27,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:27,896 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:30:27,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:30:27,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:30:27,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2025-03-04 01:30:28,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:30:28,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:30:28,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:28,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:28,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 01:30:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:28,955 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