./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.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-s_file-29.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 f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:37:53,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:37:54,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:37:54,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:37:54,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:37:54,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:37:54,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:37:54,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:37:54,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:37:54,071 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:37:54,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:37:54,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:37:54,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:37:54,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:37:54,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:37:54,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:37:54,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:37:54,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:37:54,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:37:54,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:37:54,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:37:54,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:37:54,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:37:54,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:37:54,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:37:54,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:37:54,076 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 -> f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 [2025-03-04 01:37:54,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:37:54,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:37:54,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:37:54,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:37:54,309 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:37:54,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2025-03-04 01:37:55,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b383f0548/331c0803ac1046af9b8804ca8f4515fb/FLAG2941ab77c [2025-03-04 01:37:55,678 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:37:55,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2025-03-04 01:37:55,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b383f0548/331c0803ac1046af9b8804ca8f4515fb/FLAG2941ab77c [2025-03-04 01:37:55,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b383f0548/331c0803ac1046af9b8804ca8f4515fb [2025-03-04 01:37:55,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:37:55,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:37:55,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:37:55,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:37:55,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:37:55,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:55,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55, skipping insertion in model container [2025-03-04 01:37:55,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:55,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:37:55,821 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-s_file-29.i[916,929] [2025-03-04 01:37:55,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:37:55,878 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:37:55,887 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-s_file-29.i[916,929] [2025-03-04 01:37:55,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:37:55,931 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:37:55,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55 WrapperNode [2025-03-04 01:37:55,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:37:55,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:37:55,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:37:55,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:37:55,937 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:37:55" (1/1) ... [2025-03-04 01:37:55,944 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:37:55" (1/1) ... [2025-03-04 01:37:55,970 INFO L138 Inliner]: procedures = 30, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2025-03-04 01:37:55,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:37:55,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:37:55,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:37:55,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:37:55,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:55,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:55,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:55,994 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:37:55,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:55,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:56,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:56,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:56,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:56,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:56,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:37:56,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:37:56,010 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:37:56,010 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:37:56,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (1/1) ... [2025-03-04 01:37:56,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:37:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:56,041 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:37:56,047 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:37:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:37:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:37:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:37:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:37:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:37:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:37:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:37:56,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:37:56,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:37:56,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:37:56,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:37:56,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:37:56,153 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:37:56,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:37:56,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-03-04 01:37:56,482 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 01:37:56,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:37:56,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:37:56,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:37:56,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:37:56 BoogieIcfgContainer [2025-03-04 01:37:56,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:37:56,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:37:56,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:37:56,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:37:56,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:37:55" (1/3) ... [2025-03-04 01:37:56,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1411601f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:37:56, skipping insertion in model container [2025-03-04 01:37:56,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:55" (2/3) ... [2025-03-04 01:37:56,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1411601f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:37:56, skipping insertion in model container [2025-03-04 01:37:56,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:37:56" (3/3) ... [2025-03-04 01:37:56,500 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-29.i [2025-03-04 01:37:56,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:37:56,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-29.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:37:56,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:37:56,559 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;@1bf2f9e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:37:56,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:37:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:37:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:37:56,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:56,567 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:56,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:56,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 289884733, now seen corresponding path program 1 times [2025-03-04 01:37:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778064307] [2025-03-04 01:37:56,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:56,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:37:56,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:37:56,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:56,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 01:37:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778064307] [2025-03-04 01:37:56,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778064307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:37:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680144215] [2025-03-04 01:37:56,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:37:56,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:56,854 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:37:56,856 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:37:56,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:37:57,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:37:57,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:57,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:57,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:37:57,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:37:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 01:37:57,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:37:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680144215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:57,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:37:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:37:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161290009] [2025-03-04 01:37:57,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:37:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:57,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:37:57,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:37:57,058 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 01:37:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:57,075 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2025-03-04 01:37:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:37:57,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-03-04 01:37:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:57,081 INFO L225 Difference]: With dead ends: 168 [2025-03-04 01:37:57,081 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 01:37:57,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:37:57,085 INFO L435 NwaCegarLoop]: 120 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, 120 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:37:57,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 01:37:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 01:37:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:37:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-04 01:37:57,117 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2025-03-04 01:37:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:57,117 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-04 01:37:57,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 01:37:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-04 01:37:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:37:57,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:57,120 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,127 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:37:57,320 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:37:57,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash -720500711, now seen corresponding path program 1 times [2025-03-04 01:37:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:57,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197142741] [2025-03-04 01:37:57,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:37:57,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:37:57,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:57,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 01:37:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197142741] [2025-03-04 01:37:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197142741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:57,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:57,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:37:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125220015] [2025-03-04 01:37:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:57,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:37:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:57,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:37:57,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:37:57,535 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:37:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:57,567 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2025-03-04 01:37:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:37:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-04 01:37:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:57,569 INFO L225 Difference]: With dead ends: 167 [2025-03-04 01:37:57,569 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 01:37:57,569 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:37:57,570 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:57,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 01:37:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 01:37:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:37:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-03-04 01:37:57,580 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2025-03-04 01:37:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:57,580 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-03-04 01:37:57,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:37:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-03-04 01:37:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:37:57,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:57,581 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:37:57,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:57,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:57,584 INFO L85 PathProgramCache]: Analyzing trace with hash 950012858, now seen corresponding path program 1 times [2025-03-04 01:37:57,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:57,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992132985] [2025-03-04 01:37:57,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:57,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:57,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:37:57,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:37:57,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:57,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 01:37:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992132985] [2025-03-04 01:37:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992132985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:37:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163686601] [2025-03-04 01:37:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:57,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:37:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:57,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:37:57,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:37:57,797 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:37:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:57,833 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2025-03-04 01:37:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:37:57,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-04 01:37:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:57,836 INFO L225 Difference]: With dead ends: 172 [2025-03-04 01:37:57,836 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 01:37:57,836 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:37:57,837 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:57,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 01:37:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-03-04 01:37:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:37:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2025-03-04 01:37:57,844 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 73 [2025-03-04 01:37:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:57,848 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2025-03-04 01:37:57,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:37:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2025-03-04 01:37:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:37:57,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:57,850 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:37:57,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:57,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1837516539, now seen corresponding path program 1 times [2025-03-04 01:37:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:57,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487387516] [2025-03-04 01:37:57,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:57,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:57,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:37:57,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:37:57,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:57,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 01:37:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487387516] [2025-03-04 01:37:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487387516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:57,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:37:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572298585] [2025-03-04 01:37:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:57,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:37:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:57,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:37:57,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:37:57,972 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:37:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:57,999 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2025-03-04 01:37:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:37:58,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-04 01:37:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:58,003 INFO L225 Difference]: With dead ends: 176 [2025-03-04 01:37:58,004 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 01:37:58,004 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:37:58,005 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:58,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 01:37:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-04 01:37:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:37:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-03-04 01:37:58,012 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2025-03-04 01:37:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:58,012 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-03-04 01:37:58,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:37:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-03-04 01:37:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:37:58,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:58,013 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:58,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:37:58,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:58,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1838440060, now seen corresponding path program 1 times [2025-03-04 01:37:58,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:58,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614007785] [2025-03-04 01:37:58,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:58,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:58,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:37:58,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:37:58,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:58,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:37:58,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:37:58,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:37:58,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:37:58,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:58,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:37:58,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:37:58,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:37:58,166 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:37:58,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:37:58,169 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 01:37:58,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:37:58,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:37:58 BoogieIcfgContainer [2025-03-04 01:37:58,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:37:58,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:37:58,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:37:58,203 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:37:58,204 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:37:56" (3/4) ... [2025-03-04 01:37:58,205 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:37:58,206 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:37:58,207 INFO L158 Benchmark]: Toolchain (without parser) took 2500.65ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 83.5MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2025-03-04 01:37:58,207 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:58,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.53ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:37:58,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.89ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:58,207 INFO L158 Benchmark]: Boogie Preprocessor took 36.06ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:58,207 INFO L158 Benchmark]: IcfgBuilder took 483.42ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 63.3MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:37:58,208 INFO L158 Benchmark]: TraceAbstraction took 1708.18ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 83.5MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:58,208 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:58,210 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.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.53ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.89ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.06ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 483.42ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 63.3MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1708.18ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 83.5MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 59. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L77] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L78] EXPR WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L78] EXPR WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L78] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L78] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L78] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L79] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L80] EXPR WrapperStruct00.var_1_4 [L80] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L80] EXPR WrapperStruct00.var_1_4 [L80] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L80] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] RET updateVariables() [L100] CALL step() [L50] EXPR WrapperStruct00.var_1_13 [L50] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L51] EXPR WrapperStruct00.var_1_11 [L51] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_11 [L52] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE WrapperStruct00.var_1_12 [L53] EXPR WrapperStruct00.var_1_3 [L53] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_3 [L59] EXPR WrapperStruct00.var_1_1 [L59] EXPR WrapperStruct00.var_1_1 [L59] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND FALSE !((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) [L62] EXPR WrapperStruct00.var_1_14 [L62] WrapperStruct00.var_1_5 = WrapperStruct00.var_1_14 [L64] EXPR WrapperStruct00.var_1_14 [L64] signed long int stepLocal_0 = 5 * WrapperStruct00.var_1_14; [L65] EXPR WrapperStruct00.var_1_3 [L65] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1270] [L65] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1) [L65] EXPR WrapperStruct00.var_1_3 [L65] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1270] [L65] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1270] [L65] COND FALSE !(((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) [L72] EXPR WrapperStruct00.var_1_1 [L72] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1270] [L72] COND TRUE WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3 [L73] EXPR WrapperStruct00.var_1_11 [L73] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_11 [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1) [L91] EXPR WrapperStruct00.var_1_1 [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1] [L91-L92] return (((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_11)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1147 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 675 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 472 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 290/300 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:37:58,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.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 f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:37:59,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:38:00,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:38:00,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:38:00,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:38:00,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:38:00,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:38:00,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:38:00,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:38:00,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:38:00,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:38:00,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:38:00,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:38:00,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:38:00,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:38:00,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:38:00,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:38:00,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:38:00,060 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 -> f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 [2025-03-04 01:38:00,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:38:00,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:38:00,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:38:00,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:38:00,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:38:00,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2025-03-04 01:38:01,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e708166b3/c5ce358f42e54ffca91ede592dcb26df/FLAG29aa93174 [2025-03-04 01:38:01,647 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:38:01,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2025-03-04 01:38:01,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e708166b3/c5ce358f42e54ffca91ede592dcb26df/FLAG29aa93174 [2025-03-04 01:38:01,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e708166b3/c5ce358f42e54ffca91ede592dcb26df [2025-03-04 01:38:01,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:38:01,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:38:01,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:38:01,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:38:01,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:38:01,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:01,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674af295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01, skipping insertion in model container [2025-03-04 01:38:01,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:01,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:38:01,805 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-s_file-29.i[916,929] [2025-03-04 01:38:01,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:38:01,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:38:01,871 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-s_file-29.i[916,929] [2025-03-04 01:38:01,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:38:01,930 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:38:01,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01 WrapperNode [2025-03-04 01:38:01,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:38:01,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:38:01,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:38:01,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:38:01,938 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:38:01" (1/1) ... [2025-03-04 01:38:01,953 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:38:01" (1/1) ... [2025-03-04 01:38:01,982 INFO L138 Inliner]: procedures = 34, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 414 [2025-03-04 01:38:01,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:38:01,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:38:01,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:38:01,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:38:01,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:01,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,026 INFO L175 MemorySlicer]: Split 109 memory accesses to 2 slices as follows [2, 107]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 23 writes are split as follows [0, 23]. [2025-03-04 01:38:02,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:38:02,066 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:38:02,066 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:38:02,066 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:38:02,067 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (1/1) ... [2025-03-04 01:38:02,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:38:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:02,092 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:38:02,097 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:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:38:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:38:02,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:38:02,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:38:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:38:02,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:38:02,197 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:38:11,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc property_#t~mem61#1;havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem66#1;havoc property_#t~ite69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite86#1;havoc property_#t~mem83#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite102#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1; [2025-03-04 01:38:11,474 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-04 01:38:11,475 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:38:11,485 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:38:11,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:38:11,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:11 BoogieIcfgContainer [2025-03-04 01:38:11,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:38:11,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:38:11,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:38:11,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:38:11,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:38:01" (1/3) ... [2025-03-04 01:38:11,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fbfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:11, skipping insertion in model container [2025-03-04 01:38:11,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:01" (2/3) ... [2025-03-04 01:38:11,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fbfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:11, skipping insertion in model container [2025-03-04 01:38:11,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:11" (3/3) ... [2025-03-04 01:38:11,495 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-29.i [2025-03-04 01:38:11,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:38:11,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-29.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:38:11,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:38:11,548 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;@76456198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:38:11,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:38:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:38:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:38:11,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:11,557 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:11,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:11,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 607344054, now seen corresponding path program 1 times [2025-03-04 01:38:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:11,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416771847] [2025-03-04 01:38:11,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:11,569 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:38:11,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:11,571 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:38:11,572 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:38:11,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:38:11,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:38:11,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:11,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:11,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:38:11,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 01:38:11,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:11,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416771847] [2025-03-04 01:38:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416771847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:38:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765060031] [2025-03-04 01:38:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:11,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:38:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:11,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:38:11,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:38:11,935 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 01:38:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:11,949 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2025-03-04 01:38:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:38:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-03-04 01:38:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:11,954 INFO L225 Difference]: With dead ends: 168 [2025-03-04 01:38:11,955 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 01:38:11,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:38:11,958 INFO L435 NwaCegarLoop]: 120 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, 120 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:38:11,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 01:38:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 01:38:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:38:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-04 01:38:11,983 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2025-03-04 01:38:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:11,983 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-04 01:38:11,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 01:38:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-04 01:38:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:38:11,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:11,987 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:11,996 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:38:12,187 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:38:12,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:12,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -403041390, now seen corresponding path program 1 times [2025-03-04 01:38:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:12,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137147204] [2025-03-04 01:38:12,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:12,189 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:38:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:12,191 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:38:12,192 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:38:12,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:38:12,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:38:12,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:12,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:12,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:38:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 01:38:12,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:12,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137147204] [2025-03-04 01:38:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137147204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:12,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996548889] [2025-03-04 01:38:12,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:12,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:12,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:12,619 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:38:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:12,774 INFO L93 Difference]: Finished difference Result 172 states and 247 transitions. [2025-03-04 01:38:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:38:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-04 01:38:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:12,775 INFO L225 Difference]: With dead ends: 172 [2025-03-04 01:38:12,775 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 01:38:12,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:12,776 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:12,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:38:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 01:38:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-04 01:38:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:38:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-03-04 01:38:12,782 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2025-03-04 01:38:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:12,782 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-03-04 01:38:12,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:38:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-03-04 01:38:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:38:12,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:12,784 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:12,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:38:12,984 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:38:12,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:12,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash 484462291, now seen corresponding path program 1 times [2025-03-04 01:38:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:12,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282471627] [2025-03-04 01:38:12,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:12,986 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:38:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:12,990 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:38:12,991 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:38:13,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:38:13,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:38:13,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:13,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:13,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:38:13,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 01:38:13,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:13,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:13,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282471627] [2025-03-04 01:38:13,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282471627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:13,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:13,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:38:13,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9208920] [2025-03-04 01:38:13,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:13,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:38:13,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:13,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:38:13,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:38:13,391 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:38:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:13,558 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2025-03-04 01:38:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:38:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-04 01:38:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:13,561 INFO L225 Difference]: With dead ends: 180 [2025-03-04 01:38:13,561 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 01:38:13,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:38:13,562 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:13,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:38:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 01:38:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-03-04 01:38:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:38:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2025-03-04 01:38:13,574 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2025-03-04 01:38:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:13,574 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2025-03-04 01:38:13,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:38:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2025-03-04 01:38:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:38:13,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:13,578 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:38:13,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:38:13,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:13,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash 485385812, now seen corresponding path program 1 times [2025-03-04 01:38:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:13,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229324837] [2025-03-04 01:38:13,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:13,780 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:38:13,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:13,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:38:13,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:38:13,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:38:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:38:14,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:14,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:38:14,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:14,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:38:14,194 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 94 treesize of output 34 [2025-03-04 01:38:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 01:38:14,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:14,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229324837] [2025-03-04 01:38:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229324837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:14,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:38:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727112052] [2025-03-04 01:38:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:14,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:38:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:14,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:38:14,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:38:14,298 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:38:16,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:38:19,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:38:21,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:38:23,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:38:25,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:38:28,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:38:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:28,422 INFO L93 Difference]: Finished difference Result 233 states and 324 transitions. [2025-03-04 01:38:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:38:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-04 01:38:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:28,424 INFO L225 Difference]: With dead ends: 233 [2025-03-04 01:38:28,425 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 01:38:28,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:28,427 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 58 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:28,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 305 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2025-03-04 01:38:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 01:38:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2025-03-04 01:38:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 01:38:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2025-03-04 01:38:28,435 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 73 [2025-03-04 01:38:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:28,436 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2025-03-04 01:38:28,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:38:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2025-03-04 01:38:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:38:28,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:28,439 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:28,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:38:28,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:38:28,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1838695509, now seen corresponding path program 1 times [2025-03-04 01:38:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315968514] [2025-03-04 01:38:28,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:28,641 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:38:28,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:28,644 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:38:28,645 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:38:28,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:38:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:38:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:28,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:38:28,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:29,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:38:29,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-03-04 01:38:29,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2025-03-04 01:38:29,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:38:29,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2025-03-04 01:38:30,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:38:30,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 47 [2025-03-04 01:38:30,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:38:30,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 74 [2025-03-04 01:38:30,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:38:30,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 90 [2025-03-04 01:38:30,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:38:30,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 68 [2025-03-04 01:38:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 01:38:30,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:30,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315968514] [2025-03-04 01:38:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315968514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:30,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:38:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226577902] [2025-03-04 01:38:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:30,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:38:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:30,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:38:30,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:38:30,561 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 01:38:33,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:36,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:38,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:42,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:46,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:47,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:50,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:53,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:55,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:38:59,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:39:01,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:04,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:06,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:09,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:09,740 INFO L93 Difference]: Finished difference Result 401 states and 557 transitions. [2025-03-04 01:39:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:39:09,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-03-04 01:39:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:09,742 INFO L225 Difference]: With dead ends: 401 [2025-03-04 01:39:09,742 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 01:39:09,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:39:09,742 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 689 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:09,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 446 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 570 Invalid, 1 Unknown, 0 Unchecked, 38.5s Time] [2025-03-04 01:39:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 01:39:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 133. [2025-03-04 01:39:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 117 states have (on average 1.358974358974359) internal successors, (159), 117 states have internal predecessors, (159), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:39:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2025-03-04 01:39:09,757 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 183 transitions. Word has length 73 [2025-03-04 01:39:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:09,757 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 183 transitions. [2025-03-04 01:39:09,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 01:39:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2025-03-04 01:39:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:39:09,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:09,761 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:09,771 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:39:09,962 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:39:09,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:09,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash 696736725, now seen corresponding path program 1 times [2025-03-04 01:39:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:09,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118705327] [2025-03-04 01:39:09,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:09,963 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:39:09,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:09,965 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:39:09,966 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:39:10,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:39:10,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:39:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:10,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:39:10,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:10,314 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 62 treesize of output 26 [2025-03-04 01:39:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 01:39:10,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:10,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:10,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118705327] [2025-03-04 01:39:10,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118705327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:10,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:10,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:10,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826860004] [2025-03-04 01:39:10,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:10,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:10,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:10,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:10,341 INFO L87 Difference]: Start difference. First operand 133 states and 183 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:39:12,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:14,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:17,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:21,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:23,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:25,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:28,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:32,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:33,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:36,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:37,162 INFO L93 Difference]: Finished difference Result 385 states and 531 transitions. [2025-03-04 01:39:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:39:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-03-04 01:39:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:37,169 INFO L225 Difference]: With dead ends: 385 [2025-03-04 01:39:37,169 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 01:39:37,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:37,170 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 106 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:37,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 388 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 287 Invalid, 1 Unknown, 0 Unchecked, 26.7s Time] [2025-03-04 01:39:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 01:39:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2025-03-04 01:39:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 218 states have (on average 1.353211009174312) internal successors, (295), 218 states have internal predecessors, (295), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:39:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 343 transitions. [2025-03-04 01:39:37,186 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 343 transitions. Word has length 73 [2025-03-04 01:39:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:37,187 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 343 transitions. [2025-03-04 01:39:37,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 01:39:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 343 transitions. [2025-03-04 01:39:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:39:37,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:37,191 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:37,204 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:39:37,395 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:39:37,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2050046422, now seen corresponding path program 1 times [2025-03-04 01:39:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:37,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048466481] [2025-03-04 01:39:37,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:37,396 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:39:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:37,398 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:39:37,398 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:39:37,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:39:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:39:37,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:37,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:37,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:39:37,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:37,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:39:38,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-03-04 01:39:38,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2025-03-04 01:39:38,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:38,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2025-03-04 01:39:38,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:38,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 47 [2025-03-04 01:39:38,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:38,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 74 [2025-03-04 01:39:38,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:38,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 90