./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-6.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-6.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 704df788abd4d158785e676aa1cfa96621053bb5e430ce2d41562957fb66d52d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:54:10,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:54:10,954 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:54:10,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:54:10,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:54:10,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:54:10,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:54:10,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:54:10,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:54:10,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:54:10,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:54:10,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:54:10,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:54:10,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:54:10,987 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:54:10,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:54:10,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:54:10,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:54:10,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:54:10,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:54:10,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:54:10,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:54:10,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:54:10,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:54:10,990 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 -> 704df788abd4d158785e676aa1cfa96621053bb5e430ce2d41562957fb66d52d [2025-02-06 03:54:11,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:54:11,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:54:11,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:54:11,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:54:11,227 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:54:11,228 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-6.i [2025-02-06 03:54:12,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef87fec1/31370d3982d849f98715acd9b9e3278e/FLAGf58bd921c [2025-02-06 03:54:12,746 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:54:12,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-6.i [2025-02-06 03:54:12,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef87fec1/31370d3982d849f98715acd9b9e3278e/FLAGf58bd921c [2025-02-06 03:54:13,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef87fec1/31370d3982d849f98715acd9b9e3278e [2025-02-06 03:54:13,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:54:13,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:54:13,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:54:13,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:54:13,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:54:13,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152a8622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13, skipping insertion in model container [2025-02-06 03:54:13,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:54:13,177 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-6.i[915,928] [2025-02-06 03:54:13,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:54:13,240 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:54:13,256 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-6.i[915,928] [2025-02-06 03:54:13,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:54:13,303 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:54:13,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13 WrapperNode [2025-02-06 03:54:13,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:54:13,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:54:13,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:54:13,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:54:13,314 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:54:13" (1/1) ... [2025-02-06 03:54:13,335 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:54:13" (1/1) ... [2025-02-06 03:54:13,375 INFO L138 Inliner]: procedures = 30, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 508 [2025-02-06 03:54:13,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:54:13,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:54:13,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:54:13,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:54:13,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,397 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:54:13,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:54:13,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:54:13,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:54:13,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:54:13,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (1/1) ... [2025-02-06 03:54:13,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:54:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:13,456 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:54:13,467 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:54:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:54:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:54:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:54:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:54:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:54:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:54:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:54:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:54:13,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:54:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:54:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:54:13,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:54:13,573 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:54:13,575 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:54:13,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite135#1;havoc property_#t~mem134#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem133#1;havoc property_#t~short136#1;havoc property_#t~mem142#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-02-06 03:54:14,011 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-02-06 03:54:14,011 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:54:14,023 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:54:14,024 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:54:14,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:54:14 BoogieIcfgContainer [2025-02-06 03:54:14,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:54:14,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:54:14,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:54:14,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:54:14,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:54:13" (1/3) ... [2025-02-06 03:54:14,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa6c98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:54:14, skipping insertion in model container [2025-02-06 03:54:14,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:54:13" (2/3) ... [2025-02-06 03:54:14,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa6c98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:54:14, skipping insertion in model container [2025-02-06 03:54:14,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:54:14" (3/3) ... [2025-02-06 03:54:14,034 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-6.i [2025-02-06 03:54:14,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:54:14,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-6.i that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:54:14,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:54:14,101 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;@7a9ab8ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:54:14,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:54:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:54:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:54:14,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:14,119 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:14,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:14,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash -321134822, now seen corresponding path program 1 times [2025-02-06 03:54:14,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:14,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634413009] [2025-02-06 03:54:14,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:14,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:14,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:14,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:14,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 03:54:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634413009] [2025-02-06 03:54:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634413009] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318679023] [2025-02-06 03:54:14,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:14,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:14,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:14,525 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:54:14,526 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:54:14,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:14,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:14,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:14,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:14,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:54:14,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 03:54:14,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318679023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:14,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:14,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:54:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071003979] [2025-02-06 03:54:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:14,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:54:14,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:14,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:54:14,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:54:14,758 INFO L87 Difference]: Start difference. First operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:14,776 INFO L93 Difference]: Finished difference Result 236 states and 368 transitions. [2025-02-06 03:54:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:54:14,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-02-06 03:54:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:14,781 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:54:14,781 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:54:14,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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:54:14,785 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:14,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:14,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:54:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 03:54:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:54:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2025-02-06 03:54:14,840 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 158 [2025-02-06 03:54:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:14,840 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2025-02-06 03:54:14,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2025-02-06 03:54:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:54:14,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:14,843 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:14,850 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:54:15,047 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:54:15,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:15,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2076039913, now seen corresponding path program 1 times [2025-02-06 03:54:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966796867] [2025-02-06 03:54:15,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:15,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:15,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:15,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:15,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:15,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:15,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:15,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966796867] [2025-02-06 03:54:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966796867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:15,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:54:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718498773] [2025-02-06 03:54:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:15,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:54:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:15,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:54:15,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:54:15,456 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:15,487 INFO L93 Difference]: Finished difference Result 233 states and 341 transitions. [2025-02-06 03:54:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:54:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-02-06 03:54:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:15,490 INFO L225 Difference]: With dead ends: 233 [2025-02-06 03:54:15,490 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:54:15,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:54:15,493 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:15,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:54:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 03:54:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:54:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 171 transitions. [2025-02-06 03:54:15,508 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 171 transitions. Word has length 158 [2025-02-06 03:54:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:15,512 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 171 transitions. [2025-02-06 03:54:15,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 171 transitions. [2025-02-06 03:54:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:54:15,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:15,514 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:54:15,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:15,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1231568042, now seen corresponding path program 1 times [2025-02-06 03:54:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:15,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942379837] [2025-02-06 03:54:15,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:15,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:15,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:15,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:15,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 03:54:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942379837] [2025-02-06 03:54:15,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942379837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645019459] [2025-02-06 03:54:15,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:15,849 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:54:15,853 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:54:15,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:54:16,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:54:16,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:16,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:16,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:54:16,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:16,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:16,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645019459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:16,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:54:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863991165] [2025-02-06 03:54:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:16,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:16,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:16,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:16,147 INFO L87 Difference]: Start difference. First operand 118 states and 171 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:16,178 INFO L93 Difference]: Finished difference Result 235 states and 342 transitions. [2025-02-06 03:54:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:16,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-02-06 03:54:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:16,179 INFO L225 Difference]: With dead ends: 235 [2025-02-06 03:54:16,179 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:54:16,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:16,180 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:16,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:54:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:54:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:54:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 173 transitions. [2025-02-06 03:54:16,188 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 173 transitions. Word has length 158 [2025-02-06 03:54:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:16,188 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 173 transitions. [2025-02-06 03:54:16,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 173 transitions. [2025-02-06 03:54:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:54:16,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:16,190 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:16,199 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:54:16,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:16,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:16,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1794605337, now seen corresponding path program 1 times [2025-02-06 03:54:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:16,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538702208] [2025-02-06 03:54:16,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:16,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:16,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:16,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:16,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:16,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538702208] [2025-02-06 03:54:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538702208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:16,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:54:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641725791] [2025-02-06 03:54:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:16,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:16,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:16,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:54:16,696 INFO L87 Difference]: Start difference. First operand 120 states and 173 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:16,854 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2025-02-06 03:54:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-02-06 03:54:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:16,857 INFO L225 Difference]: With dead ends: 237 [2025-02-06 03:54:16,858 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:54:16,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:54:16,860 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:16,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:54:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:54:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:54:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:54:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2025-02-06 03:54:16,867 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 160 [2025-02-06 03:54:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:16,868 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2025-02-06 03:54:16,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2025-02-06 03:54:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:54:16,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:16,869 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:16,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:54:16,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash -441295640, now seen corresponding path program 1 times [2025-02-06 03:54:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:16,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519586350] [2025-02-06 03:54:16,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:16,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:17,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:17,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 63 proven. 81 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-02-06 03:54:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519586350] [2025-02-06 03:54:19,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519586350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261315157] [2025-02-06 03:54:19,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:19,277 INFO L229 MonitoredProcess]: Starting monitored process 4 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:54:19,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:54:19,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:19,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:19,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:19,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:19,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-06 03:54:19,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:19,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 24 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2025-02-06 03:54:19,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:19,817 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 39 treesize of output 33 [2025-02-06 03:54:20,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,054 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 49 treesize of output 46 [2025-02-06 03:54:20,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,227 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 49 treesize of output 46 [2025-02-06 03:54:20,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,360 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 49 treesize of output 46 [2025-02-06 03:54:20,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,456 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 49 treesize of output 46 [2025-02-06 03:54:20,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,563 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 49 treesize of output 46 [2025-02-06 03:54:20,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,668 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 49 treesize of output 46 [2025-02-06 03:54:20,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,788 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 49 treesize of output 46 [2025-02-06 03:54:20,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:20,918 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 49 treesize of output 46 [2025-02-06 03:54:21,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:21,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 39 [2025-02-06 03:54:21,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:21,167 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 42 treesize of output 36 [2025-02-06 03:54:21,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:21,282 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 42 treesize of output 36 [2025-02-06 03:54:21,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2025-02-06 03:54:23,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:23,579 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 117 treesize of output 65 [2025-02-06 03:54:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 114 proven. 276 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-02-06 03:54:23,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:54:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261315157] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:25,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:54:25,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 14] total 32 [2025-02-06 03:54:25,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535556132] [2025-02-06 03:54:25,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:25,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:54:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:25,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:54:25,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:54:25,263 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:27,242 INFO L93 Difference]: Finished difference Result 271 states and 386 transitions. [2025-02-06 03:54:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:54:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-02-06 03:54:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:27,243 INFO L225 Difference]: With dead ends: 271 [2025-02-06 03:54:27,244 INFO L226 Difference]: Without dead ends: 154 [2025-02-06 03:54:27,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 03:54:27,245 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 130 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:27,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 680 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:54:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-06 03:54:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2025-02-06 03:54:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:54:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2025-02-06 03:54:27,259 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 160 [2025-02-06 03:54:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:27,263 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2025-02-06 03:54:27,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2025-02-06 03:54:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:54:27,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:27,264 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:27,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:54:27,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:27,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:27,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1525316763, now seen corresponding path program 1 times [2025-02-06 03:54:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:27,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795682620] [2025-02-06 03:54:27,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:27,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:27,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:54:27,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:54:27,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:27,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:28,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795682620] [2025-02-06 03:54:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795682620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:28,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:54:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81195844] [2025-02-06 03:54:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:54:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:28,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:54:28,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:54:28,506 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:29,075 INFO L93 Difference]: Finished difference Result 350 states and 497 transitions. [2025-02-06 03:54:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:54:29,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-02-06 03:54:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:29,077 INFO L225 Difference]: With dead ends: 350 [2025-02-06 03:54:29,078 INFO L226 Difference]: Without dead ends: 229 [2025-02-06 03:54:29,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:54:29,078 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 114 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:29,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 904 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:54:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-06 03:54:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2025-02-06 03:54:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 194 states have internal predecessors, (261), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:54:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2025-02-06 03:54:29,093 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 160 [2025-02-06 03:54:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:29,093 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2025-02-06 03:54:29,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2025-02-06 03:54:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 03:54:29,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:29,095 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:29,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:54:29,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:29,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1108936630, now seen corresponding path program 1 times [2025-02-06 03:54:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:29,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523927527] [2025-02-06 03:54:29,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:29,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 03:54:29,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 03:54:29,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:29,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523927527] [2025-02-06 03:54:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523927527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:30,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:30,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:54:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202117071] [2025-02-06 03:54:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:30,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:54:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:30,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:54:30,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:54:30,459 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:31,212 INFO L93 Difference]: Finished difference Result 627 states and 890 transitions. [2025-02-06 03:54:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:54:31,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-02-06 03:54:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:31,215 INFO L225 Difference]: With dead ends: 627 [2025-02-06 03:54:31,216 INFO L226 Difference]: Without dead ends: 404 [2025-02-06 03:54:31,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:54:31,217 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 146 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:31,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 552 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:54:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-06 03:54:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 317. [2025-02-06 03:54:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 264 states have (on average 1.3484848484848484) internal successors, (356), 265 states have internal predecessors, (356), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:54:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 454 transitions. [2025-02-06 03:54:31,248 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 454 transitions. Word has length 161 [2025-02-06 03:54:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:31,249 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 454 transitions. [2025-02-06 03:54:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 454 transitions. [2025-02-06 03:54:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 03:54:31,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:31,250 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:54:31,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash 264464759, now seen corresponding path program 1 times [2025-02-06 03:54:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13009049] [2025-02-06 03:54:31,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:31,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 03:54:31,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 03:54:31,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:31,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13009049] [2025-02-06 03:54:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13009049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:54:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495555982] [2025-02-06 03:54:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:54:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:54:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:54:31,667 INFO L87 Difference]: Start difference. First operand 317 states and 454 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:32,139 INFO L93 Difference]: Finished difference Result 769 states and 1098 transitions. [2025-02-06 03:54:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:54:32,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-02-06 03:54:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:32,142 INFO L225 Difference]: With dead ends: 769 [2025-02-06 03:54:32,142 INFO L226 Difference]: Without dead ends: 546 [2025-02-06 03:54:32,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:54:32,143 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 148 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:32,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1021 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:54:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-02-06 03:54:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 329. [2025-02-06 03:54:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 276 states have (on average 1.3478260869565217) internal successors, (372), 277 states have internal predecessors, (372), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:54:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 470 transitions. [2025-02-06 03:54:32,164 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 470 transitions. Word has length 161 [2025-02-06 03:54:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:32,164 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 470 transitions. [2025-02-06 03:54:32,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 470 transitions. [2025-02-06 03:54:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 03:54:32,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:32,166 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:32,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:54:32,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:32,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash 770023384, now seen corresponding path program 1 times [2025-02-06 03:54:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404728098] [2025-02-06 03:54:32,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:32,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 03:54:32,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 03:54:32,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:32,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404728098] [2025-02-06 03:54:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404728098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:33,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:54:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203932814] [2025-02-06 03:54:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:33,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:54:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:33,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:54:33,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:54:33,406 INFO L87 Difference]: Start difference. First operand 329 states and 470 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:34,742 INFO L93 Difference]: Finished difference Result 779 states and 1110 transitions. [2025-02-06 03:54:34,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:54:34,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-02-06 03:54:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:34,745 INFO L225 Difference]: With dead ends: 779 [2025-02-06 03:54:34,745 INFO L226 Difference]: Without dead ends: 544 [2025-02-06 03:54:34,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:54:34,746 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 345 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:34,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 681 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:54:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-06 03:54:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 339. [2025-02-06 03:54:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 286 states have (on average 1.3426573426573427) internal successors, (384), 287 states have internal predecessors, (384), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:54:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 482 transitions. [2025-02-06 03:54:34,784 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 482 transitions. Word has length 161 [2025-02-06 03:54:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:34,784 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 482 transitions. [2025-02-06 03:54:34,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 482 transitions. [2025-02-06 03:54:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 03:54:34,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:34,789 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:34,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:54:34,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:34,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 148749173, now seen corresponding path program 1 times [2025-02-06 03:54:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070720744] [2025-02-06 03:54:34,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:34,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 03:54:34,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 03:54:34,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:34,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:36,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:36,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070720744] [2025-02-06 03:54:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070720744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:54:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663787323] [2025-02-06 03:54:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:36,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:54:36,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:36,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:54:36,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:54:36,252 INFO L87 Difference]: Start difference. First operand 339 states and 482 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:37,544 INFO L93 Difference]: Finished difference Result 695 states and 979 transitions. [2025-02-06 03:54:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:54:37,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-02-06 03:54:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:37,547 INFO L225 Difference]: With dead ends: 695 [2025-02-06 03:54:37,547 INFO L226 Difference]: Without dead ends: 460 [2025-02-06 03:54:37,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:54:37,548 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 218 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:37,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 853 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:54:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-02-06 03:54:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 372. [2025-02-06 03:54:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 319 states have (on average 1.341692789968652) internal successors, (428), 320 states have internal predecessors, (428), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:54:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 526 transitions. [2025-02-06 03:54:37,572 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 526 transitions. Word has length 161 [2025-02-06 03:54:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:37,573 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 526 transitions. [2025-02-06 03:54:37,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 526 transitions. [2025-02-06 03:54:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 03:54:37,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:37,576 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:37,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:54:37,577 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:37,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1153883591, now seen corresponding path program 1 times [2025-02-06 03:54:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875993535] [2025-02-06 03:54:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:37,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 03:54:37,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 03:54:37,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:37,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875993535] [2025-02-06 03:54:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875993535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:39,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:54:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321249884] [2025-02-06 03:54:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:39,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:54:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:39,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:54:39,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:54:39,194 INFO L87 Difference]: Start difference. First operand 372 states and 526 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:40,218 INFO L93 Difference]: Finished difference Result 692 states and 974 transitions. [2025-02-06 03:54:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:54:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-02-06 03:54:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:40,220 INFO L225 Difference]: With dead ends: 692 [2025-02-06 03:54:40,220 INFO L226 Difference]: Without dead ends: 457 [2025-02-06 03:54:40,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:54:40,221 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 303 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:40,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 603 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:54:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-02-06 03:54:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 405. [2025-02-06 03:54:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 352 states have (on average 1.3409090909090908) internal successors, (472), 353 states have internal predecessors, (472), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:54:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 570 transitions. [2025-02-06 03:54:40,234 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 570 transitions. Word has length 162 [2025-02-06 03:54:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:40,234 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 570 transitions. [2025-02-06 03:54:40,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 570 transitions. [2025-02-06 03:54:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 03:54:40,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:40,239 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:54:40,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:40,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1865295105, now seen corresponding path program 1 times [2025-02-06 03:54:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032862300] [2025-02-06 03:54:40,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:40,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 03:54:40,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 03:54:40,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:40,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 03:54:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032862300] [2025-02-06 03:54:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032862300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003267841] [2025-02-06 03:54:40,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:40,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:40,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:40,393 INFO L229 MonitoredProcess]: Starting monitored process 5 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:54:40,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:54:40,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 03:54:40,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 03:54:40,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:40,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:40,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:54:40,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:40,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003267841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:54:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530789217] [2025-02-06 03:54:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:40,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:54:40,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:40,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:54:40,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:40,622 INFO L87 Difference]: Start difference. First operand 405 states and 570 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:40,674 INFO L93 Difference]: Finished difference Result 646 states and 912 transitions. [2025-02-06 03:54:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:54:40,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2025-02-06 03:54:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:40,676 INFO L225 Difference]: With dead ends: 646 [2025-02-06 03:54:40,676 INFO L226 Difference]: Without dead ends: 411 [2025-02-06 03:54:40,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:40,677 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:40,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-06 03:54:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-06 03:54:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 358 states have (on average 1.335195530726257) internal successors, (478), 359 states have internal predecessors, (478), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:54:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 576 transitions. [2025-02-06 03:54:40,689 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 576 transitions. Word has length 162 [2025-02-06 03:54:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:40,689 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 576 transitions. [2025-02-06 03:54:40,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 576 transitions. [2025-02-06 03:54:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:40,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:40,690 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:40,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:54:40,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 03:54:40,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -631046156, now seen corresponding path program 1 times [2025-02-06 03:54:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3375497] [2025-02-06 03:54:40,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:40,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:40,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:40,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:41,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3375497] [2025-02-06 03:54:41,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3375497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:41,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:41,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:54:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314023278] [2025-02-06 03:54:41,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:41,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:41,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:41,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:41,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:54:41,097 INFO L87 Difference]: Start difference. First operand 411 states and 576 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:41,481 INFO L93 Difference]: Finished difference Result 661 states and 923 transitions. [2025-02-06 03:54:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:41,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 163 [2025-02-06 03:54:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:41,484 INFO L225 Difference]: With dead ends: 661 [2025-02-06 03:54:41,484 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 03:54:41,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:54:41,485 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 122 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:41,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 437 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:54:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 03:54:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2025-02-06 03:54:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 331 states have (on average 1.3202416918429003) internal successors, (437), 332 states have internal predecessors, (437), 49 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:54:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 535 transitions. [2025-02-06 03:54:41,497 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 535 transitions. Word has length 163 [2025-02-06 03:54:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:41,497 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 535 transitions. [2025-02-06 03:54:41,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 535 transitions. [2025-02-06 03:54:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:41,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:41,499 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:41,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:54:41,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash -681487913, now seen corresponding path program 1 times [2025-02-06 03:54:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697505425] [2025-02-06 03:54:41,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:41,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:41,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:41,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:41,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:43,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:43,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697505425] [2025-02-06 03:54:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697505425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:43,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:54:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324724700] [2025-02-06 03:54:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:54:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:43,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:54:43,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:54:43,343 INFO L87 Difference]: Start difference. First operand 384 states and 535 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:43,913 INFO L93 Difference]: Finished difference Result 763 states and 1057 transitions. [2025-02-06 03:54:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:54:43,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-02-06 03:54:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:43,915 INFO L225 Difference]: With dead ends: 763 [2025-02-06 03:54:43,915 INFO L226 Difference]: Without dead ends: 524 [2025-02-06 03:54:43,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:54:43,917 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 68 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:43,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1209 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:54:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-02-06 03:54:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2025-02-06 03:54:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 459 states have (on average 1.318082788671024) internal successors, (605), 461 states have internal predecessors, (605), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 03:54:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 713 transitions. [2025-02-06 03:54:43,931 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 713 transitions. Word has length 163 [2025-02-06 03:54:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:43,931 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 713 transitions. [2025-02-06 03:54:43,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:54:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 713 transitions. [2025-02-06 03:54:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:54:43,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:43,932 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:43,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:54:43,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:43,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash -670171786, now seen corresponding path program 1 times [2025-02-06 03:54:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037530364] [2025-02-06 03:54:43,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:43,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:44,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:44,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:44,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 03:54:45,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:45,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037530364] [2025-02-06 03:54:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037530364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:45,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442018259] [2025-02-06 03:54:45,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:45,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:45,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:45,467 INFO L229 MonitoredProcess]: Starting monitored process 6 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:54:45,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:54:45,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:54:45,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:54:45,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:45,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:45,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 03:54:45,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:45,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2025-02-06 03:54:45,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:45,804 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 66 treesize of output 24 [2025-02-06 03:54:45,995 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 38 treesize of output 16 [2025-02-06 03:54:46,052 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 38 treesize of output 16 [2025-02-06 03:54:46,094 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 38 treesize of output 16 [2025-02-06 03:54:46,142 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 38 treesize of output 16 [2025-02-06 03:54:46,179 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 38 treesize of output 16 [2025-02-06 03:54:46,216 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 38 treesize of output 16 [2025-02-06 03:54:46,262 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 38 treesize of output 16 [2025-02-06 03:54:46,310 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 38 treesize of output 16 [2025-02-06 03:54:46,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-06 03:54:46,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:54:46,569 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 48 treesize of output 18 [2025-02-06 03:54:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 81 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 03:54:46,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:54:47,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 38 [2025-02-06 03:54:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442018259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:47,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:54:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16] total 23 [2025-02-06 03:54:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59296861] [2025-02-06 03:54:47,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:54:47,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 03:54:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:47,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 03:54:47,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:54:47,763 INFO L87 Difference]: Start difference. First operand 518 states and 713 transitions. Second operand has 23 states, 19 states have (on average 7.157894736842105) internal successors, (136), 22 states have internal predecessors, (136), 9 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 9 states have call successors, (38) [2025-02-06 03:54:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:50,715 INFO L93 Difference]: Finished difference Result 1178 states and 1589 transitions. [2025-02-06 03:54:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 03:54:50,716 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 7.157894736842105) internal successors, (136), 22 states have internal predecessors, (136), 9 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 9 states have call successors, (38) Word has length 163 [2025-02-06 03:54:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:50,719 INFO L225 Difference]: With dead ends: 1178 [2025-02-06 03:54:50,719 INFO L226 Difference]: Without dead ends: 760 [2025-02-06 03:54:50,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1031, Invalid=4519, Unknown=0, NotChecked=0, Total=5550 [2025-02-06 03:54:50,721 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 650 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:50,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1609 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 03:54:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-06 03:54:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 659. [2025-02-06 03:54:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 574 states have (on average 1.2996515679442509) internal successors, (746), 576 states have internal predecessors, (746), 73 states have call successors, (73), 11 states have call predecessors, (73), 11 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:54:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 892 transitions. [2025-02-06 03:54:50,744 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 892 transitions. Word has length 163 [2025-02-06 03:54:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:50,744 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 892 transitions. [2025-02-06 03:54:50,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 7.157894736842105) internal successors, (136), 22 states have internal predecessors, (136), 9 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 9 states have call successors, (38) [2025-02-06 03:54:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 892 transitions. [2025-02-06 03:54:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 03:54:50,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:50,745 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:50,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:54:50,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 03:54:50,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:50,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 727470528, now seen corresponding path program 1 times [2025-02-06 03:54:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192230056] [2025-02-06 03:54:50,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:50,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 03:54:50,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 03:54:50,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:50,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192230056] [2025-02-06 03:54:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192230056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:51,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:51,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:54:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001480486] [2025-02-06 03:54:51,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:51,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:54:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:51,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:54:51,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:54:51,030 INFO L87 Difference]: Start difference. First operand 659 states and 892 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:51,053 INFO L93 Difference]: Finished difference Result 1419 states and 1918 transitions. [2025-02-06 03:54:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:54:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-02-06 03:54:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:51,056 INFO L225 Difference]: With dead ends: 1419 [2025-02-06 03:54:51,057 INFO L226 Difference]: Without dead ends: 960 [2025-02-06 03:54:51,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:54:51,058 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 39 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:51,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 331 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-02-06 03:54:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 898. [2025-02-06 03:54:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 813 states have (on average 1.2878228782287824) internal successors, (1047), 815 states have internal predecessors, (1047), 73 states have call successors, (73), 11 states have call predecessors, (73), 11 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:54:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1193 transitions. [2025-02-06 03:54:51,083 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1193 transitions. Word has length 164 [2025-02-06 03:54:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:51,083 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1193 transitions. [2025-02-06 03:54:51,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1193 transitions. [2025-02-06 03:54:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 03:54:51,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:51,084 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:51,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:54:51,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:51,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1175110408, now seen corresponding path program 1 times [2025-02-06 03:54:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:51,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820301382] [2025-02-06 03:54:51,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:51,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 03:54:51,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 03:54:51,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:51,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 03:54:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820301382] [2025-02-06 03:54:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820301382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:54:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967446690] [2025-02-06 03:54:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:51,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:51,227 INFO L229 MonitoredProcess]: Starting monitored process 7 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:54:51,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:54:51,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 03:54:51,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 03:54:51,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:51,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:51,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:54:51,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:54:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:51,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:54:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967446690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:51,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:54:51,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:54:51,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437614404] [2025-02-06 03:54:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:51,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:54:51,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:51,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:54:51,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:51,467 INFO L87 Difference]: Start difference. First operand 898 states and 1193 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:51,496 INFO L93 Difference]: Finished difference Result 1520 states and 2040 transitions. [2025-02-06 03:54:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:54:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-02-06 03:54:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:51,500 INFO L225 Difference]: With dead ends: 1520 [2025-02-06 03:54:51,500 INFO L226 Difference]: Without dead ends: 910 [2025-02-06 03:54:51,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:54:51,501 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:51,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:54:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-02-06 03:54:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2025-02-06 03:54:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 825 states have (on average 1.2836363636363637) internal successors, (1059), 827 states have internal predecessors, (1059), 73 states have call successors, (73), 11 states have call predecessors, (73), 11 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:54:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1205 transitions. [2025-02-06 03:54:51,524 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1205 transitions. Word has length 164 [2025-02-06 03:54:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1205 transitions. [2025-02-06 03:54:51,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1205 transitions. [2025-02-06 03:54:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 03:54:51,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:51,526 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:51,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:54:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 03:54:51,730 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1625981179, now seen corresponding path program 1 times [2025-02-06 03:54:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732918563] [2025-02-06 03:54:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:51,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 03:54:51,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 03:54:51,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:51,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732918563] [2025-02-06 03:54:52,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732918563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:52,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:52,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:54:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113017336] [2025-02-06 03:54:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:54:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:52,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:54:52,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:54:52,196 INFO L87 Difference]: Start difference. First operand 910 states and 1205 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:53,331 INFO L93 Difference]: Finished difference Result 1880 states and 2486 transitions. [2025-02-06 03:54:53,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:54:53,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-02-06 03:54:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:53,335 INFO L225 Difference]: With dead ends: 1880 [2025-02-06 03:54:53,335 INFO L226 Difference]: Without dead ends: 1214 [2025-02-06 03:54:53,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:54:53,337 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 217 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:53,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 904 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:54:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-02-06 03:54:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 946. [2025-02-06 03:54:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 861 states have (on average 1.281068524970964) internal successors, (1103), 863 states have internal predecessors, (1103), 73 states have call successors, (73), 11 states have call predecessors, (73), 11 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-06 03:54:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1249 transitions. [2025-02-06 03:54:53,377 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1249 transitions. Word has length 164 [2025-02-06 03:54:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:53,377 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1249 transitions. [2025-02-06 03:54:53,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1249 transitions. [2025-02-06 03:54:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 03:54:53,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:53,379 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:53,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:54:53,379 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:53,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:53,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1964894425, now seen corresponding path program 1 times [2025-02-06 03:54:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:53,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551379963] [2025-02-06 03:54:53,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:53,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 03:54:53,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 03:54:53,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:53,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551379963] [2025-02-06 03:54:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551379963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:53,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:53,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:54:53,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418070076] [2025-02-06 03:54:53,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:53,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:54:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:53,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:54:53,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:54:53,978 INFO L87 Difference]: Start difference. First operand 946 states and 1249 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:55,807 INFO L93 Difference]: Finished difference Result 2986 states and 3957 transitions. [2025-02-06 03:54:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:54:55,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-02-06 03:54:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:55,813 INFO L225 Difference]: With dead ends: 2986 [2025-02-06 03:54:55,813 INFO L226 Difference]: Without dead ends: 2348 [2025-02-06 03:54:55,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:54:55,815 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 457 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:55,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1288 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 03:54:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-02-06 03:54:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1618. [2025-02-06 03:54:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1474 states have (on average 1.2734056987788331) internal successors, (1877), 1478 states have internal predecessors, (1877), 127 states have call successors, (127), 16 states have call predecessors, (127), 16 states have return successors, (127), 123 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 03:54:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2131 transitions. [2025-02-06 03:54:55,867 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2131 transitions. Word has length 164 [2025-02-06 03:54:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:55,869 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2131 transitions. [2025-02-06 03:54:55,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2131 transitions. [2025-02-06 03:54:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 03:54:55,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:55,871 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:55,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:54:55,871 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:55,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1880717724, now seen corresponding path program 1 times [2025-02-06 03:54:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884249177] [2025-02-06 03:54:55,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:55,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 03:54:55,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 03:54:55,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:54:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:54:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:54:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884249177] [2025-02-06 03:54:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884249177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:54:56,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:54:56,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:54:56,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427182133] [2025-02-06 03:54:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:54:56,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:54:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:54:56,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:54:56,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:54:56,068 INFO L87 Difference]: Start difference. First operand 1618 states and 2131 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:54:56,321 INFO L93 Difference]: Finished difference Result 2256 states and 2990 transitions. [2025-02-06 03:54:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:54:56,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2025-02-06 03:54:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:54:56,326 INFO L225 Difference]: With dead ends: 2256 [2025-02-06 03:54:56,326 INFO L226 Difference]: Without dead ends: 1514 [2025-02-06 03:54:56,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:54:56,327 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:54:56,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:54:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-02-06 03:54:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2025-02-06 03:54:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1370 states have (on average 1.264963503649635) internal successors, (1733), 1374 states have internal predecessors, (1733), 127 states have call successors, (127), 16 states have call predecessors, (127), 16 states have return successors, (127), 123 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 03:54:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1987 transitions. [2025-02-06 03:54:56,368 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1987 transitions. Word has length 164 [2025-02-06 03:54:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:54:56,368 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1987 transitions. [2025-02-06 03:54:56,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:54:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1987 transitions. [2025-02-06 03:54:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 03:54:56,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:54:56,369 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:54:56,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:54:56,370 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:54:56,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:54:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash 260673591, now seen corresponding path program 1 times [2025-02-06 03:54:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:54:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422652365] [2025-02-06 03:54:56,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:54:56,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 03:54:56,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 03:54:56,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:56,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:54:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135868655] [2025-02-06 03:54:56,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:54:56,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:54:56,456 INFO L229 MonitoredProcess]: Starting monitored process 8 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:54:56,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:54:56,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 03:54:57,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 03:54:57,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:57,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:54:57,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:54:57,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 03:54:58,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 03:54:58,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:54:58,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:54:58,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:54:58,106 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:54:58,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:54:58,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 03:54:58,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:54:58,310 INFO L422 BasicCegarLoop]: Path program histogram: [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:54:58,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:54:58,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:54:58 BoogieIcfgContainer [2025-02-06 03:54:58,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:54:58,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:54:58,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:54:58,391 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:54:58,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:54:14" (3/4) ... [2025-02-06 03:54:58,394 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:54:58,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:54:58,396 INFO L158 Benchmark]: Toolchain (without parser) took 45349.68ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 104.3MB in the beginning and 481.9MB in the end (delta: -377.6MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2025-02-06 03:54:58,396 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:54:58,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.49ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 86.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:54:58,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.42ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:54:58,397 INFO L158 Benchmark]: Boogie Preprocessor took 46.07ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 79.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:54:58,397 INFO L158 Benchmark]: IcfgBuilder took 602.04ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 44.6MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:54:58,397 INFO L158 Benchmark]: TraceAbstraction took 44363.86ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 43.5MB in the beginning and 482.0MB in the end (delta: -438.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2025-02-06 03:54:58,397 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 587.2MB. Free memory was 482.0MB in the beginning and 481.9MB in the end (delta: 143.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:54:58,399 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.49ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 86.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.42ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.07ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 79.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 602.04ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 44.6MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44363.86ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 43.5MB in the beginning and 482.0MB in the end (delta: -438.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 587.2MB. Free memory was 482.0MB in the beginning and 481.9MB in the end (delta: 143.1kB). Peak memory consumption was 8.4MB. 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 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 0, 32, 10, 4, 2, 0.0, 64.2, 0.0, 0.25, 36833, 0, 0, 0, -32, 50, 2655070710 }; [L59] unsigned char last_1_WrapperStruct00_var_1_14 = 0; [L60] signed long int last_1_WrapperStruct00_var_1_18 = -32; [L61] unsigned long int last_1_WrapperStruct00_var_1_20 = 50; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L122] EXPR WrapperStruct00.var_1_14 [L122] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L123] EXPR WrapperStruct00.var_1_18 [L123] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L124] EXPR WrapperStruct00.var_1_20 [L124] last_1_WrapperStruct00_var_1_20 = WrapperStruct00.var_1_20 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L94] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 17) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 17) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 16) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 4611686.018427387900e+12F && WrapperStruct00.var_1_9 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 4611686.018427387900e+12F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L101] EXPR (WrapperStruct00.var_1_9 >= 4611686.018427387900e+12F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 4611686.018427387900e+12F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 4611686.018427387900e+12F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L103] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427387900e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427387900e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427387900e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L105] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L107] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L108] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ushort() [L109] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L111] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L114] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L116] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L117] WrapperStruct00.var_1_21 = __VERIFIER_nondet_ulong() [L118] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L119] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L135] RET updateVariables() [L136] CALL step() [L65] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L65] COND TRUE (WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18 [L66] EXPR WrapperStruct00.var_1_9 [L66] EXPR WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_11 [L66] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L66] COND FALSE !(((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) [L72] EXPR WrapperStruct00.var_1_13 [L72] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L72] COND TRUE WrapperStruct00.var_1_13 > WrapperStruct00.var_1_6 [L73] EXPR WrapperStruct00.var_1_6 [L73] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L73] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13) [L73] EXPR WrapperStruct00.var_1_6 [L73] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L73] EXPR WrapperStruct00.var_1_6 [L73] WrapperStruct00.var_1_18 = (((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_6) [L75] COND FALSE !(\read(last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L78] EXPR WrapperStruct00.var_1_21 [L78] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L78] EXPR ((((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) < ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7))) ? (((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) : ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L78] WrapperStruct00.var_1_20 = ((((((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) < ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7))) ? (((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) : ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7)))) [L79] EXPR WrapperStruct00.var_1_20 [L79] unsigned long int stepLocal_1 = WrapperStruct00.var_1_20; [L80] EXPR WrapperStruct00.var_1_20 [L80] unsigned long int stepLocal_0 = WrapperStruct00.var_1_20; [L81] EXPR WrapperStruct00.var_1_18 [L81] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50, stepLocal_0=50, stepLocal_1=50] [L81] EXPR ((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) [L81] EXPR WrapperStruct00.var_1_18 [L81] EXPR ((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50, stepLocal_0=50, stepLocal_1=50] [L81] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50, stepLocal_0=50, stepLocal_1=50] [L81] COND FALSE !((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > stepLocal_1) [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR WrapperStruct00.var_1_18 [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR ((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) [L127] EXPR WrapperStruct00.var_1_18 [L127] EXPR ((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR WrapperStruct00.var_1_4 [L127] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR ((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_1 == ((unsigned long int) 1000000000u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) 128u))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR (((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_1 == ((unsigned long int) 1000000000u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) 128u))) : 1) && (((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13))) [L127] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR ((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13)) [L127] EXPR WrapperStruct00.var_1_9 [L127] EXPR WrapperStruct00.var_1_10 [L127] EXPR WrapperStruct00.var_1_11 [L127] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR (((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1 [L127] EXPR WrapperStruct00.var_1_6 [L127] EXPR WrapperStruct00.var_1_13 [L127] EXPR WrapperStruct00.var_1_8 [L127] EXPR (((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR ((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR (((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_1 == ((unsigned long int) 1000000000u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) 128u))) : 1) && (((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR ((((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_1 == ((unsigned long int) 1000000000u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) 128u))) : 1) && (((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13)))) && (last_1_WrapperStruct00_var_1_14 ? (WrapperStruct00.var_1_14 == ((unsigned char) (WrapperStruct00.var_1_16 && WrapperStruct00.var_1_17))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR (((((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_1 == ((unsigned long int) 1000000000u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) 128u))) : 1) && (((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13)))) && (last_1_WrapperStruct00_var_1_14 ? (WrapperStruct00.var_1_14 == ((unsigned char) (WrapperStruct00.var_1_16 && WrapperStruct00.var_1_17))) : 1)) && ((WrapperStruct00.var_1_13 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_18 == ((signed long int) (((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_6))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127] EXPR ((((((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_1 == ((unsigned long int) 1000000000u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) 128u))) : 1) && (((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13)))) && (last_1_WrapperStruct00_var_1_14 ? (WrapperStruct00.var_1_14 == ((unsigned char) (WrapperStruct00.var_1_16 && WrapperStruct00.var_1_17))) : 1)) && ((WrapperStruct00.var_1_13 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_18 == ((signed long int) (((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_6))) : 1)) && (WrapperStruct00.var_1_20 == ((unsigned long int) ((((((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) < ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7))) ? (((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) : ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L127-L128] return ((((((((((WrapperStruct00.var_1_18) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18))) / WrapperStruct00.var_1_4) > WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_1 == ((unsigned long int) 1000000000u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) 128u))) : 1) && (((WrapperStruct00.var_1_4 - last_1_WrapperStruct00_var_1_20) == last_1_WrapperStruct00_var_1_18) ? ((((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_8))) : 1) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_13)))) && (last_1_WrapperStruct00_var_1_14 ? (WrapperStruct00.var_1_14 == ((unsigned char) (WrapperStruct00.var_1_16 && WrapperStruct00.var_1_17))) : 1)) && ((WrapperStruct00.var_1_13 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_18 == ((signed long int) (((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13))) - WrapperStruct00.var_1_6))) : 1)) && (WrapperStruct00.var_1_20 == ((unsigned long int) ((((((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) < ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7))) ? (((((last_1_WrapperStruct00_var_1_20) < 0 ) ? -(last_1_WrapperStruct00_var_1_20) : (last_1_WrapperStruct00_var_1_20)))) : ((WrapperStruct00.var_1_21 - WrapperStruct00.var_1_7)))))) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_18=-32, last_1_WrapperStruct00_var_1_20=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 21, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2971 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2957 mSDsluCounter, 14168 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10962 mSDsCounter, 896 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10382 IncrementalHoareTripleChecker+Invalid, 11278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 896 mSolverCounterUnsat, 3206 mSDtfsCounter, 10382 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1613 GetRequests, 1360 SyntacticMatches, 3 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1618occurred in iteration=19, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1852 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 4526 NumberOfCodeBlocks, 4526 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4329 ConstructedInterpolants, 0 QuantifiedInterpolants, 23576 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3405 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 17811/18468 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:54:58,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-6.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 704df788abd4d158785e676aa1cfa96621053bb5e430ce2d41562957fb66d52d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:55:00,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:55:00,493 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:55:00,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:55:00,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:55:00,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:55:00,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:55:00,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:55:00,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:55:00,512 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:55:00,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:55:00,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:55:00,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:55:00,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:55:00,512 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:55:00,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:55:00,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:55:00,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:55:00,514 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:55:00,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:55:00,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:55:00,515 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:55:00,515 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:55:00,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:55:00,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:55:00,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:55:00,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:55:00,515 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 -> 704df788abd4d158785e676aa1cfa96621053bb5e430ce2d41562957fb66d52d [2025-02-06 03:55:00,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:55:00,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:55:00,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:55:00,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:55:00,815 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:55:00,816 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-6.i [2025-02-06 03:55:02,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcb5c31df/e4a90212127340fbba9371af37fe96c5/FLAG24ffaa757 [2025-02-06 03:55:02,197 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:55:02,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-6.i [2025-02-06 03:55:02,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcb5c31df/e4a90212127340fbba9371af37fe96c5/FLAG24ffaa757 [2025-02-06 03:55:02,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcb5c31df/e4a90212127340fbba9371af37fe96c5 [2025-02-06 03:55:02,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:55:02,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:55:02,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:55:02,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:55:02,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:55:02,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e685289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02, skipping insertion in model container [2025-02-06 03:55:02,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:55:02,701 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-6.i[915,928] [2025-02-06 03:55:02,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:55:02,781 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:55:02,790 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-6.i[915,928] [2025-02-06 03:55:02,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:55:02,854 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:55:02,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02 WrapperNode [2025-02-06 03:55:02,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:55:02,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:55:02,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:55:02,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:55:02,861 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:55:02" (1/1) ... [2025-02-06 03:55:02,880 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:55:02" (1/1) ... [2025-02-06 03:55:02,909 INFO L138 Inliner]: procedures = 37, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2025-02-06 03:55:02,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:55:02,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:55:02,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:55:02,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:55:02,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,937 INFO L175 MemorySlicer]: Split 136 memory accesses to 2 slices as follows [2, 134]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-02-06 03:55:02,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:55:02,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:55:02,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:55:02,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:55:02,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (1/1) ... [2025-02-06 03:55:02,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:55:02,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:55:03,006 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:55:03,015 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:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:55:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:55:03,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:55:03,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:55:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:55:03,163 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:55:03,164 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:55:07,881 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite135#1;havoc property_#t~mem134#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem133#1;havoc property_#t~short136#1;havoc property_#t~mem142#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-02-06 03:55:07,914 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-02-06 03:55:07,914 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:55:07,927 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:55:07,928 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:55:07,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:55:07 BoogieIcfgContainer [2025-02-06 03:55:07,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:55:07,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:55:07,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:55:07,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:55:07,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:55:02" (1/3) ... [2025-02-06 03:55:07,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571d6681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:55:07, skipping insertion in model container [2025-02-06 03:55:07,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:55:02" (2/3) ... [2025-02-06 03:55:07,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571d6681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:55:07, skipping insertion in model container [2025-02-06 03:55:07,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:55:07" (3/3) ... [2025-02-06 03:55:07,942 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-6.i [2025-02-06 03:55:07,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:55:07,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-6.i that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:55:08,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:55:08,044 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;@4b82e979, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:55:08,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:55:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:08,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:08,056 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:08,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:08,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash -963337313, now seen corresponding path program 1 times [2025-02-06 03:55:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327426929] [2025-02-06 03:55:08,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:08,068 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:55:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:08,070 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:55:08,071 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:55:08,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:08,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:08,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:08,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:08,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:55:08,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 03:55:08,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:08,457 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:08,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327426929] [2025-02-06 03:55:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327426929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:08,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:08,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:55:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273742140] [2025-02-06 03:55:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:55:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:08,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:55:08,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:55:08,474 INFO L87 Difference]: Start difference. First operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:08,493 INFO L93 Difference]: Finished difference Result 236 states and 368 transitions. [2025-02-06 03:55:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:55:08,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-02-06 03:55:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:08,499 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:55:08,499 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:55:08,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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:55:08,503 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:08,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:55:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 03:55:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2025-02-06 03:55:08,582 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 158 [2025-02-06 03:55:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:08,582 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2025-02-06 03:55:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2025-02-06 03:55:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:55:08,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:08,586 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:08,598 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:55:08,791 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:55:08,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:08,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1433837422, now seen corresponding path program 1 times [2025-02-06 03:55:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694710847] [2025-02-06 03:55:08,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:08,794 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:55:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:08,797 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:55:08,798 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:55:08,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:55:09,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:55:09,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:09,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:09,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:55:09,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:09,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:09,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694710847] [2025-02-06 03:55:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694710847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:09,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:09,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:55:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968692750] [2025-02-06 03:55:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:09,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:55:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:09,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:55:09,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:09,106 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:09,141 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2025-02-06 03:55:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:55:09,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-02-06 03:55:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:09,146 INFO L225 Difference]: With dead ends: 235 [2025-02-06 03:55:09,146 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:55:09,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:55:09,147 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:09,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:55:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:55:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2025-02-06 03:55:09,158 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 158 [2025-02-06 03:55:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:09,159 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2025-02-06 03:55:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2025-02-06 03:55:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:55:09,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:09,161 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:09,172 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:55:09,361 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:55:09,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -181700724, now seen corresponding path program 1 times [2025-02-06 03:55:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:09,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396835941] [2025-02-06 03:55:09,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:09,363 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:55:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:09,368 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:55:09,369 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:55:09,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:55:09,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:55:09,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:09,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:09,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:55:09,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:09,671 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 19 treesize of output 7 [2025-02-06 03:55:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:09,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:09,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396835941] [2025-02-06 03:55:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396835941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:55:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361367685] [2025-02-06 03:55:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:09,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:55:09,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:09,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:55:09,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:55:09,682 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:09,747 INFO L93 Difference]: Finished difference Result 237 states and 345 transitions. [2025-02-06 03:55:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:55:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-02-06 03:55:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:09,755 INFO L225 Difference]: With dead ends: 237 [2025-02-06 03:55:09,755 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:55:09,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:55:09,756 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:09,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:55:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:55:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:55:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 173 transitions. [2025-02-06 03:55:09,769 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 173 transitions. Word has length 160 [2025-02-06 03:55:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:09,770 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 173 transitions. [2025-02-06 03:55:09,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 173 transitions. [2025-02-06 03:55:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:55:09,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:09,771 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:09,788 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:55:09,976 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:55:09,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:09,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash 29650189, now seen corresponding path program 1 times [2025-02-06 03:55:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679976217] [2025-02-06 03:55:09,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:09,979 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:55:09,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:09,984 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:55:09,987 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:55:10,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:55:10,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:55:10,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:10,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:10,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:55:10,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:10,292 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 19 treesize of output 7 [2025-02-06 03:55:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:10,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:10,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:10,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679976217] [2025-02-06 03:55:10,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679976217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:10,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:55:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718645551] [2025-02-06 03:55:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:55:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:10,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:55:10,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:55:10,307 INFO L87 Difference]: Start difference. First operand 120 states and 173 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:10,326 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2025-02-06 03:55:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:55:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-02-06 03:55:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:10,329 INFO L225 Difference]: With dead ends: 237 [2025-02-06 03:55:10,329 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:55:10,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:55:10,331 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:10,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:55:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:55:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:55:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2025-02-06 03:55:10,341 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 160 [2025-02-06 03:55:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:10,342 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2025-02-06 03:55:10,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2025-02-06 03:55:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:55:10,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:10,346 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:10,358 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 (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:55:10,547 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:55:10,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:10,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1382959886, now seen corresponding path program 1 times [2025-02-06 03:55:10,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:10,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777526273] [2025-02-06 03:55:10,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:10,549 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:55:10,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:10,555 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:55:10,556 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:55:10,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:55:10,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:55:10,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:10,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:10,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:55:10,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:10,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:10,978 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 175 treesize of output 67 [2025-02-06 03:55:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-02-06 03:55:11,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:11,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:11,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777526273] [2025-02-06 03:55:11,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777526273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:11,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:55:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965271207] [2025-02-06 03:55:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:11,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:55:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:11,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:55:11,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:55:11,005 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:12,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:55:14,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:55:16,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:55:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:16,250 INFO L93 Difference]: Finished difference Result 238 states and 342 transitions. [2025-02-06 03:55:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:55:16,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2025-02-06 03:55:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:16,255 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:55:16,255 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 03:55:16,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:55:16,256 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 141 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:16,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 491 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-06 03:55:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 03:55:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-02-06 03:55:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 171 transitions. [2025-02-06 03:55:16,261 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 171 transitions. Word has length 160 [2025-02-06 03:55:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:16,261 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 171 transitions. [2025-02-06 03:55:16,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 171 transitions. [2025-02-06 03:55:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 03:55:16,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:16,263 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:16,285 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:55:16,463 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:55:16,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1562563692, now seen corresponding path program 1 times [2025-02-06 03:55:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:16,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372500139] [2025-02-06 03:55:16,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:16,465 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:55:16,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:16,467 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:55:16,469 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:55:16,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 03:55:16,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 03:55:16,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:16,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:16,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:55:16,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:16,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:16,892 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 173 treesize of output 65 [2025-02-06 03:55:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-02-06 03:55:16,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:16,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372500139] [2025-02-06 03:55:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372500139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:55:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643412247] [2025-02-06 03:55:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:55:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:16,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:55:16,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:55:16,924 INFO L87 Difference]: Start difference. First operand 120 states and 171 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:20,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:55:21,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:55:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:22,044 INFO L93 Difference]: Finished difference Result 238 states and 340 transitions. [2025-02-06 03:55:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:55:22,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-02-06 03:55:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:22,048 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:55:22,048 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 03:55:22,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:55:22,049 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 131 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:22,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 487 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-06 03:55:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 03:55:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-02-06 03:55:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-02-06 03:55:22,062 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 162 [2025-02-06 03:55:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:22,062 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-02-06 03:55:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-02-06 03:55:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 03:55:22,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:22,071 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:22,094 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:55:22,272 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:55:22,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:22,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash -477020402, now seen corresponding path program 1 times [2025-02-06 03:55:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:22,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089004176] [2025-02-06 03:55:22,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:22,274 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:55:22,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:22,277 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:55:22,280 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:55:22,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 03:55:22,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 03:55:22,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:22,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:22,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:55:22,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:22,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:22,749 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 173 treesize of output 65 [2025-02-06 03:55:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 03:55:22,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:22,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:22,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089004176] [2025-02-06 03:55:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089004176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:22,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:22,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:55:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831557846] [2025-02-06 03:55:22,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:22,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:55:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:22,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:55:22,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:55:22,776 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:25,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:55:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:55:27,385 INFO L93 Difference]: Finished difference Result 238 states and 338 transitions. [2025-02-06 03:55:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:55:27,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 164 [2025-02-06 03:55:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:55:27,387 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:55:27,387 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 03:55:27,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:55:27,388 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 123 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:55:27,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 483 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 03:55:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 03:55:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-02-06 03:55:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 99 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:55:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2025-02-06 03:55:27,406 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 164 [2025-02-06 03:55:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:55:27,406 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2025-02-06 03:55:27,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 03:55:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2025-02-06 03:55:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 03:55:27,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:55:27,412 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:55:27,439 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 (8)] Ended with exit code 0 [2025-02-06 03:55:27,612 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:55:27,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:55:27,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:55:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1153658260, now seen corresponding path program 1 times [2025-02-06 03:55:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:55:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387528635] [2025-02-06 03:55:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:55:27,615 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:55:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:55:27,618 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:55:27,619 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:55:27,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 03:55:27,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 03:55:27,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:55:27,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:55:27,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:55:27,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:55:28,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:55:28,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 [2025-02-06 03:55:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 03:55:28,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:55:28,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:55:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387528635] [2025-02-06 03:55:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387528635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:55:28,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:55:28,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:55:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721362814] [2025-02-06 03:55:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:55:28,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:55:28,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:55:28,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:55:28,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:55:28,452 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 03:55:30,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:55:34,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []