./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:52:22,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:52:22,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:52:22,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:52:22,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:52:22,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:52:22,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:52:22,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:52:22,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:52:22,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:52:22,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:52:22,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:52:22,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:52:22,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:52:22,231 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:52:22,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:52:22,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:52:22,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:52:22,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:52:22,233 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:52:22,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:52:22,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:52:22,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:52:22,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:52:22,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:52:22,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:52:22,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:52:22,234 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-jdk21/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 -> 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 [2025-02-06 03:52:22,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:52:22,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:52:22,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:52:22,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:52:22,470 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:52:22,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i [2025-02-06 03:52:23,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afe8d59e8/b229d15784c34725b29fad89b2cfd02d/FLAG2bac471c4 [2025-02-06 03:52:23,878 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:52:23,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i [2025-02-06 03:52:23,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afe8d59e8/b229d15784c34725b29fad89b2cfd02d/FLAG2bac471c4 [2025-02-06 03:52:24,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afe8d59e8/b229d15784c34725b29fad89b2cfd02d [2025-02-06 03:52:24,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:52:24,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:52:24,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:52:24,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:52:24,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:52:24,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24, skipping insertion in model container [2025-02-06 03:52:24,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:52:24,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i[916,929] [2025-02-06 03:52:24,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:52:24,391 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:52:24,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i[916,929] [2025-02-06 03:52:24,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:52:24,446 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:52:24,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24 WrapperNode [2025-02-06 03:52:24,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:52:24,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:52:24,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:52:24,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:52:24,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,485 INFO L138 Inliner]: procedures = 30, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 395 [2025-02-06 03:52:24,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:52:24,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:52:24,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:52:24,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:52:24,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,499 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:52:24,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:52:24,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:52:24,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:52:24,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:52:24,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (1/1) ... [2025-02-06 03:52:24,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:52:24,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:52:24,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:52:24,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:52:24,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:52:24,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:52:24,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:52:24,631 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:52:24,633 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:52:24,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc property_#t~mem58#1;havoc property_#t~ite80#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~ite78#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~ite66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite72#1;havoc property_#t~mem67#1;havoc property_#t~mem71#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short70#1;havoc property_#t~mem73#1;havoc property_#t~ite77#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~bitwise88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1; [2025-02-06 03:52:24,988 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-02-06 03:52:24,988 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:52:25,003 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:52:25,004 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:52:25,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:25 BoogieIcfgContainer [2025-02-06 03:52:25,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:52:25,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:52:25,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:52:25,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:52:25,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:52:24" (1/3) ... [2025-02-06 03:52:25,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182b1927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:25, skipping insertion in model container [2025-02-06 03:52:25,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:24" (2/3) ... [2025-02-06 03:52:25,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182b1927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:25, skipping insertion in model container [2025-02-06 03:52:25,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:25" (3/3) ... [2025-02-06 03:52:25,013 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-46.i [2025-02-06 03:52:25,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:52:25,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-46.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:52:25,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:52:25,069 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;@5d00a291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:52:25,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:52:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:52:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:52:25,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:25,081 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:25,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1180957268, now seen corresponding path program 1 times [2025-02-06 03:52:25,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316769066] [2025-02-06 03:52:25,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:25,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:25,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:52:25,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:52:25,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:25,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:52:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:52:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316769066] [2025-02-06 03:52:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316769066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:52:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992202246] [2025-02-06 03:52:25,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:25,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:52:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:52:25,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:52:25,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:52:25,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:52:25,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:52:25,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:25,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:25,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:52:25,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:52:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:52:25,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:52:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992202246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:25,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:52:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:52:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134288145] [2025-02-06 03:52:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:25,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:52:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:52:25,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:52:25,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:52:25,583 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:52:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:25,610 INFO L93 Difference]: Finished difference Result 194 states and 299 transitions. [2025-02-06 03:52:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:52:25,613 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-02-06 03:52:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:25,618 INFO L225 Difference]: With dead ends: 194 [2025-02-06 03:52:25,618 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 03:52:25,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-02-06 03:52:25,625 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:25,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:52:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 03:52:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 03:52:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:52:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2025-02-06 03:52:25,651 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 116 [2025-02-06 03:52:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:25,651 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2025-02-06 03:52:25,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:52:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2025-02-06 03:52:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:52:25,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:25,657 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:25,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:52:25,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:52:25,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:25,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash 856081694, now seen corresponding path program 1 times [2025-02-06 03:52:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-02-06 03:52:25,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:25,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:52:25,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:52:25,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:25,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:52:27,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:52:27,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-02-06 03:52:27,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499218895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:52:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:52:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392377231] [2025-02-06 03:52:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:52:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:52:27,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:52:27,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:52:27,500 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:28,006 INFO L93 Difference]: Finished difference Result 348 states and 504 transitions. [2025-02-06 03:52:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:52:28,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:52:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:28,009 INFO L225 Difference]: With dead ends: 348 [2025-02-06 03:52:28,009 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 03:52:28,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:52:28,010 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 172 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:28,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 415 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:52:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 03:52:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 249. [2025-02-06 03:52:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.412037037037037) internal successors, (305), 217 states have internal predecessors, (305), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:52:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 363 transitions. [2025-02-06 03:52:28,045 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 363 transitions. Word has length 116 [2025-02-06 03:52:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:28,045 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 363 transitions. [2025-02-06 03:52:28,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 363 transitions. [2025-02-06 03:52:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:52:28,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:28,047 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:28,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:52:28,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:28,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash 562678687, now seen corresponding path program 1 times [2025-02-06 03:52:28,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701334523] [2025-02-06 03:52:28,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:28,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:52:28,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:52:28,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:28,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:52:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:52:28,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701334523] [2025-02-06 03:52:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701334523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:52:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:52:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765975068] [2025-02-06 03:52:28,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:52:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:52:28,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:52:28,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:52:28,402 INFO L87 Difference]: Start difference. First operand 249 states and 363 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:28,648 INFO L93 Difference]: Finished difference Result 747 states and 1092 transitions. [2025-02-06 03:52:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:52:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:52:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:28,656 INFO L225 Difference]: With dead ends: 747 [2025-02-06 03:52:28,656 INFO L226 Difference]: Without dead ends: 501 [2025-02-06 03:52:28,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:52:28,658 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 119 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:28,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 377 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:52:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-06 03:52:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 285. [2025-02-06 03:52:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 252 states have (on average 1.4087301587301588) internal successors, (355), 253 states have internal predecessors, (355), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:52:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 413 transitions. [2025-02-06 03:52:28,692 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 413 transitions. Word has length 116 [2025-02-06 03:52:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:28,692 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 413 transitions. [2025-02-06 03:52:28,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 413 transitions. [2025-02-06 03:52:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:52:28,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:28,694 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:28,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:52:28,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:28,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1575871783, now seen corresponding path program 1 times [2025-02-06 03:52:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:52:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644281830] [2025-02-06 03:52:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:52:28,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:52:28,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:52:28,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:28,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:52:28,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209222676] [2025-02-06 03:52:28,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:28,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:52:28,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:52:28,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:52:28,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:52:28,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:52:29,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:52:29,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:29,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:52:29,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:52:29,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:52:29,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:52:29,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:29,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:52:29,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:52:29,800 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:52:29,800 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:52:29,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:52:30,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:52:30,005 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:52:30,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:52:30,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:52:30 BoogieIcfgContainer [2025-02-06 03:52:30,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:52:30,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:52:30,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:52:30,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:52:30,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:25" (3/4) ... [2025-02-06 03:52:30,057 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:52:30,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:52:30,058 INFO L158 Benchmark]: Toolchain (without parser) took 5835.83ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 112.0MB in the beginning and 297.5MB in the end (delta: -185.6MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2025-02-06 03:52:30,058 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:52:30,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:52:30,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.55ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:52:30,058 INFO L158 Benchmark]: Boogie Preprocessor took 39.09ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:52:30,059 INFO L158 Benchmark]: IcfgBuilder took 479.53ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 61.4MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:52:30,059 INFO L158 Benchmark]: TraceAbstraction took 5047.60ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.9MB in the beginning and 297.5MB in the end (delta: -236.7MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2025-02-06 03:52:30,059 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 419.4MB. Free memory is still 297.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:52:30,060 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.55ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.09ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 479.53ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 61.4MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5047.60ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.9MB in the beginning and 297.5MB in the end (delta: -236.7MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 419.4MB. Free memory is still 297.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L49] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L50] signed short int last_1_WrapperStruct00_var_1_10 = -4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L112] EXPR WrapperStruct00.var_1_1 [L112] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L113] EXPR WrapperStruct00.var_1_10 [L113] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L90] EXPR WrapperStruct00.var_1_2 [L90] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_2 [L90] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L98] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_short() [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L107] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L108] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L124] RET updateVariables() [L125] CALL step() [L54] EXPR WrapperStruct00.var_1_12 [L54] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L54] COND FALSE !(last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) [L59] EXPR WrapperStruct00.var_1_4 [L59] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L59] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13) [L59] EXPR WrapperStruct00.var_1_4 [L59] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L59] signed long int stepLocal_1 = (((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13)); [L60] EXPR WrapperStruct00.var_1_13 [L60] EXPR WrapperStruct00.var_1_4 [L60] signed long int stepLocal_0 = WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4; [L61] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-27] [L61] COND TRUE (- WrapperStruct00.var_1_2) >= 16.75 [L62] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-27] [L62] COND TRUE stepLocal_0 >= WrapperStruct00.var_1_13 [L63] COND TRUE stepLocal_1 > -32 [L64] WrapperStruct00.var_1_1 = 0 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L78] EXPR WrapperStruct00.var_1_13 [L78] signed char stepLocal_2 = WrapperStruct00.var_1_13; [L79] EXPR WrapperStruct00.var_1_13 [L79] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L79] EXPR WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L79] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L79] COND TRUE ((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < stepLocal_2 [L80] EXPR WrapperStruct00.var_1_12 [L80] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_12 - 256) [L84] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L84] COND FALSE !(1 == WrapperStruct00.var_1_4) [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR ((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1)) [L116] EXPR WrapperStruct00.var_1_1 [L116] EXPR ((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR ((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) ? (last_1_WrapperStruct00_var_1_1 ? (WrapperStruct00.var_1_13 == ((signed char) WrapperStruct00.var_1_16)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116-L117] return (((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) ? (last_1_WrapperStruct00_var_1_1 ? (WrapperStruct00.var_1_13 == ((signed char) WrapperStruct00.var_1_16)) : 1) : 1) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 930 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 611 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 815 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 319 mSDtfsCounter, 815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=3, 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 221 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1430/1456 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-02-06 03:52:30,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:52:31,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:52:32,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:52:32,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:52:32,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:52:32,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:52:32,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:52:32,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:52:32,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:52:32,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:52:32,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:52:32,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:52:32,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:52:32,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:52:32,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:52:32,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:52:32,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:52:32,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:52:32,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:52:32,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:52:32,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:52:32,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:52:32,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:52:32,090 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-jdk21/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 -> 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 [2025-02-06 03:52:32,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:52:32,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:52:32,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:52:32,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:52:32,346 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:52:32,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i [2025-02-06 03:52:33,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2df984d8/db5ffe4fb2434b378965a795d4cc74df/FLAGb1498635d [2025-02-06 03:52:33,714 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:52:33,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i [2025-02-06 03:52:33,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2df984d8/db5ffe4fb2434b378965a795d4cc74df/FLAGb1498635d [2025-02-06 03:52:33,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2df984d8/db5ffe4fb2434b378965a795d4cc74df [2025-02-06 03:52:33,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:52:33,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:52:33,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:52:33,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:52:33,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:52:33,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:33" (1/1) ... [2025-02-06 03:52:33,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1bb063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:33, skipping insertion in model container [2025-02-06 03:52:33,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:52:33" (1/1) ... [2025-02-06 03:52:33,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:52:33,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i[916,929] [2025-02-06 03:52:33,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:52:33,934 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:52:33,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i[916,929] [2025-02-06 03:52:33,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:52:34,002 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:52:34,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34 WrapperNode [2025-02-06 03:52:34,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:52:34,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:52:34,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:52:34,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:52:34,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,044 INFO L138 Inliner]: procedures = 34, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 373 [2025-02-06 03:52:34,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:52:34,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:52:34,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:52:34,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:52:34,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,077 INFO L175 MemorySlicer]: Split 102 memory accesses to 2 slices as follows [2, 100]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-02-06 03:52:34,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:52:34,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:52:34,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:52:34,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:52:34,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (1/1) ... [2025-02-06 03:52:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:52:34,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:52:34,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:52:34,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:52:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:52:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:52:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:52:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:52:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:52:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:52:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:52:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:52:34,245 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:52:34,247 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:52:34,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc property_#t~mem57#1;havoc property_#t~ite79#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite77#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~ite71#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~short69#1;havoc property_#t~mem72#1;havoc property_#t~ite76#1;havoc property_#t~mem73#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short100#1; [2025-02-06 03:52:34,839 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-02-06 03:52:34,839 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:52:34,847 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:52:34,847 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:52:34,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:34 BoogieIcfgContainer [2025-02-06 03:52:34,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:52:34,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:52:34,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:52:34,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:52:34,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:52:33" (1/3) ... [2025-02-06 03:52:34,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c41ad38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:34, skipping insertion in model container [2025-02-06 03:52:34,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:52:34" (2/3) ... [2025-02-06 03:52:34,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c41ad38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:52:34, skipping insertion in model container [2025-02-06 03:52:34,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:52:34" (3/3) ... [2025-02-06 03:52:34,857 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-46.i [2025-02-06 03:52:34,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:52:34,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-46.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:52:34,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:52:34,912 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;@40676323, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:52:34,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:52:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 75 states have (on average 1.4) internal successors, (105), 76 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:52:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:52:34,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:34,928 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:34,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:34,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash 647389320, now seen corresponding path program 1 times [2025-02-06 03:52:34,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:52:34,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114436457] [2025-02-06 03:52:34,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:34,944 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-02-06 03:52:34,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:52:34,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 03:52:34,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:35,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:52:35,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:52:35,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:35,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:35,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:52:35,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:52:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-06 03:52:35,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:52:35,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:52:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114436457] [2025-02-06 03:52:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114436457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:52:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:52:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039748039] [2025-02-06 03:52:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:35,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:52:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:52:35,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:52:35,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:52:35,298 INFO L87 Difference]: Start difference. First operand has 92 states, 75 states have (on average 1.4) internal successors, (105), 76 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:52:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:35,318 INFO L93 Difference]: Finished difference Result 178 states and 275 transitions. [2025-02-06 03:52:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:52:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 03:52:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:35,326 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:52:35,326 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:52:35,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-02-06 03:52:35,332 INFO L435 NwaCegarLoop]: 128 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, 128 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-02-06 03:52:35,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:52:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:52:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:52:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:52:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2025-02-06 03:52:35,365 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2025-02-06 03:52:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:35,365 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2025-02-06 03:52:35,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:52:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2025-02-06 03:52:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:52:35,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:35,369 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:35,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-06 03:52:35,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 03:52:35,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 640570490, now seen corresponding path program 1 times [2025-02-06 03:52:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:52:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447449589] [2025-02-06 03:52:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:35,572 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-02-06 03:52:35,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:52:35,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 03:52:35,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:35,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:52:35,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:52:35,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:35,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:52:35,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:52:35,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:52:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2025-02-06 03:52:36,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:36,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 79 [2025-02-06 03:52:36,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:36,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 80 [2025-02-06 03:52:36,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:36,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2025-02-06 03:52:37,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:37,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 83 [2025-02-06 03:52:37,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:37,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2025-02-06 03:52:38,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:38,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 93 [2025-02-06 03:52:38,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:38,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 93 [2025-02-06 03:52:39,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:39,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 107 [2025-02-06 03:52:39,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:39,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 111 [2025-02-06 03:52:39,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:39,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 103 treesize of output 45 [2025-02-06 03:52:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 40 proven. 292 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 03:52:39,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:52:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:52:39,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:52:39,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447449589] [2025-02-06 03:52:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447449589] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:52:39,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:52:39,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2025-02-06 03:52:39,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59868826] [2025-02-06 03:52:39,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:39,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:52:39,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:52:39,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:52:39,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:52:39,755 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:52:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:40,578 INFO L93 Difference]: Finished difference Result 316 states and 456 transitions. [2025-02-06 03:52:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:52:40,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 03:52:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:40,580 INFO L225 Difference]: With dead ends: 316 [2025-02-06 03:52:40,580 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:52:40,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:52:40,581 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 298 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:40,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 317 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:52:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:52:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2025-02-06 03:52:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 192 states have (on average 1.4010416666666667) internal successors, (269), 193 states have internal predecessors, (269), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:52:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 327 transitions. [2025-02-06 03:52:40,606 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 327 transitions. Word has length 114 [2025-02-06 03:52:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:40,607 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 327 transitions. [2025-02-06 03:52:40,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:52:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 327 transitions. [2025-02-06 03:52:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:52:40,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:40,608 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:40,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:40,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 03:52:40,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:40,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 347167483, now seen corresponding path program 1 times [2025-02-06 03:52:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:52:40,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947577325] [2025-02-06 03:52:40,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:40,814 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-02-06 03:52:40,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:52:40,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 03:52:40,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:40,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:52:41,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:52:41,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:41,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:41,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:52:41,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:52:41,040 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 12 treesize of output 8 [2025-02-06 03:52:41,048 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 28 treesize of output 12 [2025-02-06 03:52:41,063 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 37 treesize of output 25 [2025-02-06 03:52:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:52:41,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:52:41,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:52:41,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947577325] [2025-02-06 03:52:41,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947577325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:41,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:52:41,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:52:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028927374] [2025-02-06 03:52:41,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:41,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:52:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:52:41,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:52:41,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:52:41,076 INFO L87 Difference]: Start difference. First operand 225 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:41,446 INFO L93 Difference]: Finished difference Result 675 states and 984 transitions. [2025-02-06 03:52:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:52:41,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-02-06 03:52:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:41,450 INFO L225 Difference]: With dead ends: 675 [2025-02-06 03:52:41,450 INFO L226 Difference]: Without dead ends: 453 [2025-02-06 03:52:41,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:52:41,451 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 109 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:41,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 330 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:52:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-02-06 03:52:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 249. [2025-02-06 03:52:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.3935185185185186) internal successors, (301), 217 states have internal predecessors, (301), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:52:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 359 transitions. [2025-02-06 03:52:41,474 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 359 transitions. Word has length 114 [2025-02-06 03:52:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 359 transitions. [2025-02-06 03:52:41,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 359 transitions. [2025-02-06 03:52:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:52:41,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:41,476 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:41,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:41,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-06 03:52:41,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1928828427, now seen corresponding path program 1 times [2025-02-06 03:52:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:52:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140211526] [2025-02-06 03:52:41,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:41,678 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-02-06 03:52:41,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:52:41,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-06 03:52:41,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:41,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:52:41,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:52:41,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:41,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:41,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:52:41,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:52:41,901 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 25 treesize of output 10 [2025-02-06 03:52:43,742 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_14| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_14|) (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)))) is different from true [2025-02-06 03:52:43,762 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 25 treesize of output 24 [2025-02-06 03:52:43,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:43,861 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 35 treesize of output 37 [2025-02-06 03:52:43,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:43,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2025-02-06 03:52:44,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:44,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-02-06 03:52:44,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:44,212 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 55 treesize of output 63 [2025-02-06 03:52:44,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:44,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 66 [2025-02-06 03:52:44,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:44,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 93 [2025-02-06 03:52:45,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:45,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 93 [2025-02-06 03:52:46,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:52:46,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 54 [2025-02-06 03:52:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 52 not checked. [2025-02-06 03:52:46,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:52:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:52:50,516 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:52:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140211526] [2025-02-06 03:52:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140211526] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:52:50,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:52:50,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-02-06 03:52:50,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628876928] [2025-02-06 03:52:50,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:50,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:52:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:52:50,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:52:50,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=92, Unknown=2, NotChecked=20, Total=156 [2025-02-06 03:52:50,517 INFO L87 Difference]: Start difference. First operand 249 states and 359 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:52:55,349 INFO L93 Difference]: Finished difference Result 602 states and 868 transitions. [2025-02-06 03:52:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:52:55,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:52:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:52:55,353 INFO L225 Difference]: With dead ends: 602 [2025-02-06 03:52:55,353 INFO L226 Difference]: Without dead ends: 356 [2025-02-06 03:52:55,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=47, Invalid=110, Unknown=3, NotChecked=22, Total=182 [2025-02-06 03:52:55,354 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 96 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:52:55,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 346 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:52:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-06 03:52:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 249. [2025-02-06 03:52:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.3796296296296295) internal successors, (298), 217 states have internal predecessors, (298), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:52:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 356 transitions. [2025-02-06 03:52:55,373 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 356 transitions. Word has length 116 [2025-02-06 03:52:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:52:55,373 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 356 transitions. [2025-02-06 03:52:55,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:52:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 356 transitions. [2025-02-06 03:52:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:52:55,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:52:55,375 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:52:55,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:55,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-06 03:52:55,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:52:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:52:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash -425527015, now seen corresponding path program 1 times [2025-02-06 03:52:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:52:55,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812284131] [2025-02-06 03:52:55,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:52:55,576 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-02-06 03:52:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:52:55,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-06 03:52:55,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:52:55,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:52:55,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:52:55,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:52:55,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:52:55,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:52:55,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:52:55,796 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 23 treesize of output 11 [2025-02-06 03:52:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:52:55,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:52:55,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:52:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812284131] [2025-02-06 03:52:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812284131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:52:55,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:52:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:52:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906155976] [2025-02-06 03:52:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:52:55,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:52:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:52:55,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:52:55,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:52:55,976 INFO L87 Difference]: Start difference. First operand 249 states and 356 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:00,532 INFO L93 Difference]: Finished difference Result 589 states and 836 transitions. [2025-02-06 03:53:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:53:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:53:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:00,536 INFO L225 Difference]: With dead ends: 589 [2025-02-06 03:53:00,536 INFO L226 Difference]: Without dead ends: 343 [2025-02-06 03:53:00,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:53:00,537 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 56 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:00,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 332 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 03:53:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-06 03:53:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2025-02-06 03:53:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 259 states have (on average 1.3745173745173744) internal successors, (356), 261 states have internal predecessors, (356), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:53:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 416 transitions. [2025-02-06 03:53:00,555 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 416 transitions. Word has length 116 [2025-02-06 03:53:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:00,555 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 416 transitions. [2025-02-06 03:53:00,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 416 transitions. [2025-02-06 03:53:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:53:00,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:00,556 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:00,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:53:00,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-02-06 03:53:00,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -622040520, now seen corresponding path program 1 times [2025-02-06 03:53:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645261333] [2025-02-06 03:53:00,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:00,758 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-02-06 03:53:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:00,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-02-06 03:53:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:53:00,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:53:00,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:53:00,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:00,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:00,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:53:00,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:53:00,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:00,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645261333] [2025-02-06 03:53:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645261333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:00,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:00,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:53:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998724265] [2025-02-06 03:53:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:00,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:53:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:00,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:53:00,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:53:00,952 INFO L87 Difference]: Start difference. First operand 294 states and 416 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:01,020 INFO L93 Difference]: Finished difference Result 595 states and 843 transitions. [2025-02-06 03:53:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:53:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:53:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:01,024 INFO L225 Difference]: With dead ends: 595 [2025-02-06 03:53:01,024 INFO L226 Difference]: Without dead ends: 304 [2025-02-06 03:53:01,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:53:01,025 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:01,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:53:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-06 03:53:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-06 03:53:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 271 states have internal predecessors, (366), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:53:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 426 transitions. [2025-02-06 03:53:01,049 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 426 transitions. Word has length 116 [2025-02-06 03:53:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:01,049 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 426 transitions. [2025-02-06 03:53:01,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 426 transitions. [2025-02-06 03:53:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:53:01,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:01,050 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:01,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:53:01,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-02-06 03:53:01,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:01,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1721727911, now seen corresponding path program 1 times [2025-02-06 03:53:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689183854] [2025-02-06 03:53:01,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:01,252 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-02-06 03:53:01,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:01,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-02-06 03:53:01,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:53:01,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:53:01,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:53:01,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:01,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:01,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:53:01,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:01,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:01,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:01,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:01,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 31 [2025-02-06 03:53:01,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:01,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2025-02-06 03:53:05,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:05,647 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 55 treesize of output 63 [2025-02-06 03:53:06,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:06,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 57 [2025-02-06 03:53:06,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:06,585 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 60 treesize of output 53 [2025-02-06 03:53:06,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:06,845 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 55 treesize of output 63 [2025-02-06 03:53:07,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:07,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 66 [2025-02-06 03:53:07,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:07,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 57 [2025-02-06 03:53:07,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:07,969 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 53 treesize of output 61 [2025-02-06 03:53:08,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:08,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 107 treesize of output 79 [2025-02-06 03:53:08,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:08,354 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 59 treesize of output 25 [2025-02-06 03:53:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 76 proven. 224 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 03:53:08,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:53:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:53:08,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:08,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689183854] [2025-02-06 03:53:08,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689183854] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:08,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:08,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-02-06 03:53:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140943518] [2025-02-06 03:53:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:53:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:08,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:53:08,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=166, Unknown=1, NotChecked=0, Total=210 [2025-02-06 03:53:08,665 INFO L87 Difference]: Start difference. First operand 304 states and 426 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:09,184 INFO L93 Difference]: Finished difference Result 715 states and 994 transitions. [2025-02-06 03:53:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:53:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:53:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:09,188 INFO L225 Difference]: With dead ends: 715 [2025-02-06 03:53:09,188 INFO L226 Difference]: Without dead ends: 414 [2025-02-06 03:53:09,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=48, Invalid=191, Unknown=1, NotChecked=0, Total=240 [2025-02-06 03:53:09,189 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 120 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:09,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 298 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:53:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-06 03:53:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 308. [2025-02-06 03:53:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 273 states have (on average 1.3553113553113554) internal successors, (370), 275 states have internal predecessors, (370), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:53:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 430 transitions. [2025-02-06 03:53:09,200 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 430 transitions. Word has length 116 [2025-02-06 03:53:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:09,200 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 430 transitions. [2025-02-06 03:53:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 430 transitions. [2025-02-06 03:53:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:53:09,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:09,201 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:09,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-06 03:53:09,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-02-06 03:53:09,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -368418214, now seen corresponding path program 1 times [2025-02-06 03:53:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:09,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452628011] [2025-02-06 03:53:09,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:09,407 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-02-06 03:53:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:09,408 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-02-06 03:53:09,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:53:09,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:53:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:53:09,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:09,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:09,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:53:09,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:09,649 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-02-06 03:53:09,827 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 42 treesize of output 20 [2025-02-06 03:53:09,924 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 37 treesize of output 30 [2025-02-06 03:53:10,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:10,167 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 45 treesize of output 41 [2025-02-06 03:53:10,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:10,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 54 [2025-02-06 03:53:10,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:10,350 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 72 treesize of output 68 [2025-02-06 03:53:10,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:10,556 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 116 treesize of output 52 [2025-02-06 03:53:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 212 proven. 24 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 03:53:10,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:53:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:53:10,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:10,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452628011] [2025-02-06 03:53:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452628011] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:10,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:10,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 19 [2025-02-06 03:53:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035022696] [2025-02-06 03:53:10,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:10,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:53:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:10,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:53:10,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:53:10,859 INFO L87 Difference]: Start difference. First operand 308 states and 430 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:11,624 INFO L93 Difference]: Finished difference Result 669 states and 929 transitions. [2025-02-06 03:53:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:53:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 03:53:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:11,628 INFO L225 Difference]: With dead ends: 669 [2025-02-06 03:53:11,628 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 03:53:11,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:53:11,629 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 76 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:11,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 574 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:53:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 03:53:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2025-02-06 03:53:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 301 states have (on average 1.3322259136212624) internal successors, (401), 304 states have internal predecessors, (401), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 03:53:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 491 transitions. [2025-02-06 03:53:11,645 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 491 transitions. Word has length 116 [2025-02-06 03:53:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:11,645 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 491 transitions. [2025-02-06 03:53:11,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 491 transitions. [2025-02-06 03:53:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:53:11,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:11,646 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:11,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:53:11,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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-02-06 03:53:11,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:11,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1242131570, now seen corresponding path program 1 times [2025-02-06 03:53:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:11,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405007152] [2025-02-06 03:53:11,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:11,848 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-02-06 03:53:11,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:11,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-02-06 03:53:11,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:53:11,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:53:12,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:53:12,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:12,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:12,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:53:12,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:12,099 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 14 treesize of output 10 [2025-02-06 03:53:12,253 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 41 treesize of output 19 [2025-02-06 03:53:12,356 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 41 treesize of output 19 [2025-02-06 03:53:12,445 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 41 treesize of output 19 [2025-02-06 03:53:12,582 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 41 treesize of output 19 [2025-02-06 03:53:12,770 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 34 treesize of output 27 [2025-02-06 03:53:12,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:12,841 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 38 treesize of output 25 [2025-02-06 03:53:12,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:12,920 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 29 treesize of output 13 [2025-02-06 03:53:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 203 proven. 24 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-06 03:53:12,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:53:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:53:13,295 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405007152] [2025-02-06 03:53:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405007152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:53:13,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:53:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-02-06 03:53:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791886114] [2025-02-06 03:53:13,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:53:13,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:53:13,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:13,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:53:13,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:53:13,296 INFO L87 Difference]: Start difference. First operand 354 states and 491 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:53:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:15,374 INFO L93 Difference]: Finished difference Result 957 states and 1300 transitions. [2025-02-06 03:53:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:53:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 118 [2025-02-06 03:53:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:15,379 INFO L225 Difference]: With dead ends: 957 [2025-02-06 03:53:15,379 INFO L226 Difference]: Without dead ends: 618 [2025-02-06 03:53:15,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:53:15,381 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 529 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:15,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 269 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 03:53:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-06 03:53:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 588. [2025-02-06 03:53:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 509 states have (on average 1.31237721021611) internal successors, (668), 516 states have internal predecessors, (668), 61 states have call successors, (61), 17 states have call predecessors, (61), 17 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-06 03:53:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 790 transitions. [2025-02-06 03:53:15,415 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 790 transitions. Word has length 118 [2025-02-06 03:53:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:15,415 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 790 transitions. [2025-02-06 03:53:15,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:53:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 790 transitions. [2025-02-06 03:53:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:53:15,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:15,419 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:15,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:53:15,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/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-02-06 03:53:15,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:15,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1535534577, now seen corresponding path program 1 times [2025-02-06 03:53:15,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:15,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380792767] [2025-02-06 03:53:15,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:15,620 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-02-06 03:53:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:15,622 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/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-02-06 03:53:15,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:53:15,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:53:15,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:53:15,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:15,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:15,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:53:15,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:15,888 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 30 treesize of output 1 [2025-02-06 03:53:15,892 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-02-06 03:53:15,896 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 14 treesize of output 10 [2025-02-06 03:53:15,942 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 30 treesize of output 14 [2025-02-06 03:53:15,989 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 30 treesize of output 14 [2025-02-06 03:53:16,035 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 25 treesize of output 24 [2025-02-06 03:53:16,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:16,138 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 40 treesize of output 27 [2025-02-06 03:53:16,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:16,322 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 88 treesize of output 72 [2025-02-06 03:53:16,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:16,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 103 treesize of output 75 [2025-02-06 03:53:16,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:16,474 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 135 treesize of output 47 [2025-02-06 03:53:20,518 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_192 (_ BitVec 32)) (v_arrayElimCell_194 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat v_arrayElimCell_194 v_arrayElimCell_192))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (not (fp.geq (fp.neg .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0)))) (= |c_ULTIMATE.start_property_#t~mem57#1| .cse0)))) is different from true [2025-02-06 03:53:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 03:53:20,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:20,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380792767] [2025-02-06 03:53:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380792767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:53:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2321167] [2025-02-06 03:53:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:20,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:53:20,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:20,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:53:20,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=17, Unknown=1, NotChecked=8, Total=42 [2025-02-06 03:53:20,521 INFO L87 Difference]: Start difference. First operand 588 states and 790 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:53:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:22,284 INFO L93 Difference]: Finished difference Result 1235 states and 1657 transitions. [2025-02-06 03:53:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:53:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-02-06 03:53:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:22,288 INFO L225 Difference]: With dead ends: 1235 [2025-02-06 03:53:22,288 INFO L226 Difference]: Without dead ends: 662 [2025-02-06 03:53:22,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=21, Invalid=24, Unknown=1, NotChecked=10, Total=56 [2025-02-06 03:53:22,290 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 243 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:22,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 153 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 222 Invalid, 0 Unknown, 160 Unchecked, 1.3s Time] [2025-02-06 03:53:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-06 03:53:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 588. [2025-02-06 03:53:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 509 states have (on average 1.3045186640471513) internal successors, (664), 516 states have internal predecessors, (664), 61 states have call successors, (61), 17 states have call predecessors, (61), 17 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-06 03:53:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 786 transitions. [2025-02-06 03:53:22,318 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 786 transitions. Word has length 118 [2025-02-06 03:53:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:22,318 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 786 transitions. [2025-02-06 03:53:22,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:53:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 786 transitions. [2025-02-06 03:53:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:53:22,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:22,320 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:22,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:53:22,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/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-02-06 03:53:22,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:22,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2034364394, now seen corresponding path program 1 times [2025-02-06 03:53:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:22,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803080031] [2025-02-06 03:53:22,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:22,522 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-02-06 03:53:22,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:22,524 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/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-02-06 03:53:22,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:53:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:53:22,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:53:22,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:22,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:22,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:53:22,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:22,837 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-02-06 03:53:22,841 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 25 treesize of output 25 [2025-02-06 03:53:22,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:22,935 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 78 treesize of output 42 [2025-02-06 03:53:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:53:22,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:53:22,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803080031] [2025-02-06 03:53:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803080031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:53:22,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:53:22,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:53:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698198976] [2025-02-06 03:53:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:22,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:53:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:22,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:53:22,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:53:22,977 INFO L87 Difference]: Start difference. First operand 588 states and 786 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:23,704 INFO L93 Difference]: Finished difference Result 1435 states and 1905 transitions. [2025-02-06 03:53:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:53:23,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:53:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:23,707 INFO L225 Difference]: With dead ends: 1435 [2025-02-06 03:53:23,708 INFO L226 Difference]: Without dead ends: 862 [2025-02-06 03:53:23,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:53:23,710 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 74 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:23,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 600 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:53:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-02-06 03:53:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 858. [2025-02-06 03:53:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 741 states have (on average 1.2847503373819162) internal successors, (952), 752 states have internal predecessors, (952), 89 states have call successors, (89), 27 states have call predecessors, (89), 27 states have return successors, (89), 78 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-06 03:53:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1130 transitions. [2025-02-06 03:53:23,757 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1130 transitions. Word has length 118 [2025-02-06 03:53:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:23,757 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1130 transitions. [2025-02-06 03:53:23,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1130 transitions. [2025-02-06 03:53:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:53:23,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:23,759 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:23,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 03:53:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/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-02-06 03:53:23,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash -291554059, now seen corresponding path program 1 times [2025-02-06 03:53:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:23,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021628840] [2025-02-06 03:53:23,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:23,960 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-02-06 03:53:23,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:23,962 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/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-02-06 03:53:23,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:53:24,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:53:24,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:53:24,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:24,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:24,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:53:24,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:24,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:24,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2025-02-06 03:53:24,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:24,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 99 [2025-02-06 03:53:28,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:28,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 106 [2025-02-06 03:53:33,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:33,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 115 [2025-02-06 03:53:34,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 109 [2025-02-06 03:53:35,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:35,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 106 [2025-02-06 03:53:36,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:36,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 96 [2025-02-06 03:53:36,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:36,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 83 [2025-02-06 03:53:37,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:37,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 87 [2025-02-06 03:53:37,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:37,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 127 treesize of output 105 [2025-02-06 03:53:38,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:38,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 109 treesize of output 45 [2025-02-06 03:53:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 308 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 03:53:38,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:53:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:53:38,915 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:38,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021628840] [2025-02-06 03:53:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021628840] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:53:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2025-02-06 03:53:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781193769] [2025-02-06 03:53:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:53:38,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:53:38,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:38,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:53:38,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=212, Unknown=2, NotChecked=0, Total=272 [2025-02-06 03:53:38,916 INFO L87 Difference]: Start difference. First operand 858 states and 1130 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:53:39,705 INFO L93 Difference]: Finished difference Result 1700 states and 2240 transitions. [2025-02-06 03:53:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:53:39,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:53:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:53:39,710 INFO L225 Difference]: With dead ends: 1700 [2025-02-06 03:53:39,710 INFO L226 Difference]: Without dead ends: 857 [2025-02-06 03:53:39,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=63, Invalid=241, Unknown=2, NotChecked=0, Total=306 [2025-02-06 03:53:39,712 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:53:39,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 281 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:53:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-06 03:53:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 854. [2025-02-06 03:53:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 737 states have (on average 1.2808683853459972) internal successors, (944), 748 states have internal predecessors, (944), 89 states have call successors, (89), 27 states have call predecessors, (89), 27 states have return successors, (89), 78 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-06 03:53:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1122 transitions. [2025-02-06 03:53:39,770 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1122 transitions. Word has length 118 [2025-02-06 03:53:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:53:39,771 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1122 transitions. [2025-02-06 03:53:39,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:53:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1122 transitions. [2025-02-06 03:53:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:53:39,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:53:39,772 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:53:39,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:53:39,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/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-02-06 03:53:39,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:53:39,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:53:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1416131031, now seen corresponding path program 1 times [2025-02-06 03:53:39,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:53:39,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175548413] [2025-02-06 03:53:39,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:39,974 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-02-06 03:53:39,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:53:39,976 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/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-02-06 03:53:39,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:53:40,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:53:40,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:53:40,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:40,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:40,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:53:40,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:40,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:40,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 21 [2025-02-06 03:53:40,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:40,274 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 41 treesize of output 47 [2025-02-06 03:53:44,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:44,558 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 55 treesize of output 63 [2025-02-06 03:53:45,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:45,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 76 [2025-02-06 03:53:45,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:45,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2025-02-06 03:53:46,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:46,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2025-02-06 03:53:46,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:46,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 93 [2025-02-06 03:53:47,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:47,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 102 [2025-02-06 03:53:48,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:48,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 120 [2025-02-06 03:53:48,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:48,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 143 treesize of output 61 [2025-02-06 03:53:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 156 proven. 160 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 03:53:48,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:53:49,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:53:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175548413] [2025-02-06 03:53:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175548413] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1599084087] [2025-02-06 03:53:49,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:53:49,797 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:53:49,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:53:49,800 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:53:49,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-02-06 03:53:49,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:53:50,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:53:50,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:53:50,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:53:50,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:53:50,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:53:50,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:53:50,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 37 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 17 [2025-02-06 03:53:50,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:50,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-02-06 03:53:50,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:50,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2025-02-06 03:53:51,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:51,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 03:53:51,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:51,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 03:53:51,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:51,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 35 [2025-02-06 03:53:51,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:51,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 03:53:52,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:52,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2025-02-06 03:53:52,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:52,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 60 [2025-02-06 03:53:53,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:53:53,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 45 [2025-02-06 03:53:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 60 proven. 192 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 03:53:53,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:53:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1599084087] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:53:53,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:53:53,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-06 03:53:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053897460] [2025-02-06 03:53:53,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:53:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:53:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:53:53,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:53:53,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=475, Unknown=1, NotChecked=0, Total=600 [2025-02-06 03:53:53,734 INFO L87 Difference]: Start difference. First operand 854 states and 1122 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 19 states have internal predecessors, (107), 10 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28)