./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.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-75.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 aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:55:58,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:55:58,966 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:55:58,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:55:58,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:55:58,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:55:58,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:55:58,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:55:58,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:55:58,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:55:58,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:55:58,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:55:58,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:55:58,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:55:58,988 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:55:58,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:55:58,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:55:58,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:55:58,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:55:58,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:55:58,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 -> aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc [2025-02-06 03:55:59,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:55:59,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:55:59,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:55:59,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:55:59,218 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:55:59,219 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-75.i [2025-02-06 03:56:00,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9ae20d5a/5efb3252fd954bc48bdaca8fe05c3464/FLAG7ea97422f [2025-02-06 03:56:00,610 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:56:00,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i [2025-02-06 03:56:00,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9ae20d5a/5efb3252fd954bc48bdaca8fe05c3464/FLAG7ea97422f [2025-02-06 03:56:00,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9ae20d5a/5efb3252fd954bc48bdaca8fe05c3464 [2025-02-06 03:56:00,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:56:00,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:56:00,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:00,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:56:00,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:56:00,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:00" (1/1) ... [2025-02-06 03:56:00,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153a86e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:00, skipping insertion in model container [2025-02-06 03:56:00,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:00" (1/1) ... [2025-02-06 03:56:00,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:56:01,063 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-75.i[916,929] [2025-02-06 03:56:01,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:01,114 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:56:01,120 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-75.i[916,929] [2025-02-06 03:56:01,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:01,163 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:56:01,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01 WrapperNode [2025-02-06 03:56:01,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:01,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:01,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:56:01,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:56:01,168 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:56:01" (1/1) ... [2025-02-06 03:56:01,175 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:56:01" (1/1) ... [2025-02-06 03:56:01,211 INFO L138 Inliner]: procedures = 30, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2025-02-06 03:56:01,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:01,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:56:01,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:56:01,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:56:01,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,230 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:56:01,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:56:01,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:56:01,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:56:01,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:56:01,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (1/1) ... [2025-02-06 03:56:01,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:01,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:01,279 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:56:01,282 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:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:56:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:56:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:56:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:56:01,374 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:56:01,376 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:56:01,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-02-06 03:56:01,742 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-02-06 03:56:01,743 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:56:01,753 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:56:01,753 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:56:01,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:01 BoogieIcfgContainer [2025-02-06 03:56:01,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:56:01,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:56:01,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:56:01,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:56:01,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:56:00" (1/3) ... [2025-02-06 03:56:01,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3187b87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:01, skipping insertion in model container [2025-02-06 03:56:01,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:01" (2/3) ... [2025-02-06 03:56:01,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3187b87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:01, skipping insertion in model container [2025-02-06 03:56:01,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:01" (3/3) ... [2025-02-06 03:56:01,762 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-75.i [2025-02-06 03:56:01,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:56:01,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-75.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:56:01,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:56:01,820 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;@2aaf5d72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:56:01,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:56:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:01,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:01,835 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:01,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash 308523144, now seen corresponding path program 1 times [2025-02-06 03:56:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433158946] [2025-02-06 03:56:01,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:01,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:01,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:01,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:56:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433158946] [2025-02-06 03:56:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433158946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635450987] [2025-02-06 03:56:02,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:02,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:02,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:02,157 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:56:02,158 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:56:02,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:02,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:02,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:02,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:02,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:56:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:56:02,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:02,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635450987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:02,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:02,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:56:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070690308] [2025-02-06 03:56:02,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:02,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:56:02,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:02,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:56:02,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:56:02,391 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:02,409 INFO L93 Difference]: Finished difference Result 186 states and 292 transitions. [2025-02-06 03:56:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:56:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-02-06 03:56:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:02,415 INFO L225 Difference]: With dead ends: 186 [2025-02-06 03:56:02,415 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:56:02,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 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:56:02,419 INFO L435 NwaCegarLoop]: 135 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, 135 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:56:02,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:56:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 03:56:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-02-06 03:56:02,457 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2025-02-06 03:56:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:02,458 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-02-06 03:56:02,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-02-06 03:56:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:02,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:02,464 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:56:02,664 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:56:02,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:02,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1727239871, now seen corresponding path program 1 times [2025-02-06 03:56:02,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050134391] [2025-02-06 03:56:02,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:02,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:02,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:02,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:02,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:02,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050134391] [2025-02-06 03:56:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050134391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:02,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348461747] [2025-02-06 03:56:02,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:02,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:02,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:02,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:02,930 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:02,964 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2025-02-06 03:56:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:02,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-02-06 03:56:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:02,968 INFO L225 Difference]: With dead ends: 185 [2025-02-06 03:56:02,969 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:56:02,969 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:56:02,969 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 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:56:02,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:56:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 03:56:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-02-06 03:56:02,983 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2025-02-06 03:56:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:02,984 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-02-06 03:56:02,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-02-06 03:56:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:02,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:02,987 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:56:02,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1086153728, now seen corresponding path program 1 times [2025-02-06 03:56:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690414724] [2025-02-06 03:56:02,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:03,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:03,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:03,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:03,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:03,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690414724] [2025-02-06 03:56:03,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690414724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:03,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:03,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108310140] [2025-02-06 03:56:03,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:03,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:03,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:03,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:03,139 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:03,166 INFO L93 Difference]: Finished difference Result 189 states and 274 transitions. [2025-02-06 03:56:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-02-06 03:56:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:03,167 INFO L225 Difference]: With dead ends: 189 [2025-02-06 03:56:03,168 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 03:56:03,168 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:56:03,168 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 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:56:03,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 03:56:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 03:56:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-02-06 03:56:03,176 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 136 [2025-02-06 03:56:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:03,176 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-02-06 03:56:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-02-06 03:56:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:03,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:03,178 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:56:03,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:03,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash -61459807, now seen corresponding path program 1 times [2025-02-06 03:56:03,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511331919] [2025-02-06 03:56:03,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:03,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:03,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:03,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:03,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:03,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511331919] [2025-02-06 03:56:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511331919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:03,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455806747] [2025-02-06 03:56:03,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:03,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:03,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:03,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:03,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:03,342 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:03,373 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-02-06 03:56:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:56:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:03,375 INFO L225 Difference]: With dead ends: 194 [2025-02-06 03:56:03,376 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:56:03,377 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:56:03,378 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:03,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:56:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-06 03:56:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-02-06 03:56:03,387 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2025-02-06 03:56:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:03,389 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-02-06 03:56:03,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-02-06 03:56:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:03,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:03,390 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:56:03,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:03,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash 826043874, now seen corresponding path program 1 times [2025-02-06 03:56:03,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:03,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866532378] [2025-02-06 03:56:03,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:03,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:03,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:03,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:03,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:03,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866532378] [2025-02-06 03:56:03,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866532378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:03,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:03,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:03,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464056443] [2025-02-06 03:56:03,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:03,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:03,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:03,533 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:03,558 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2025-02-06 03:56:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:03,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:56:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:03,560 INFO L225 Difference]: With dead ends: 198 [2025-02-06 03:56:03,561 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 03:56:03,561 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:56:03,563 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:03,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 03:56:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-02-06 03:56:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-02-06 03:56:03,568 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 136 [2025-02-06 03:56:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:03,568 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-02-06 03:56:03,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-02-06 03:56:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:03,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:03,569 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:56:03,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 826967395, now seen corresponding path program 1 times [2025-02-06 03:56:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275503703] [2025-02-06 03:56:03,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:03,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:03,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:03,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:05,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:05,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275503703] [2025-02-06 03:56:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275503703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840026689] [2025-02-06 03:56:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:05,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:05,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:05,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:05,223 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:05,435 INFO L93 Difference]: Finished difference Result 199 states and 283 transitions. [2025-02-06 03:56:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:05,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-02-06 03:56:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:05,437 INFO L225 Difference]: With dead ends: 199 [2025-02-06 03:56:05,437 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:56:05,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:05,438 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 46 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:05,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 418 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:56:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 03:56:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2025-02-06 03:56:05,443 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 136 [2025-02-06 03:56:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:05,443 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2025-02-06 03:56:05,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2025-02-06 03:56:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:56:05,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:05,444 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:56:05,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:05,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1494733343, now seen corresponding path program 1 times [2025-02-06 03:56:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338596265] [2025-02-06 03:56:05,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:05,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:56:05,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:56:05,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:05,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338596265] [2025-02-06 03:56:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338596265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:07,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:07,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:56:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458863128] [2025-02-06 03:56:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:07,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:56:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:07,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:56:07,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:56:07,821 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:56:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:08,949 INFO L93 Difference]: Finished difference Result 383 states and 540 transitions. [2025-02-06 03:56:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:56:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 138 [2025-02-06 03:56:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:08,954 INFO L225 Difference]: With dead ends: 383 [2025-02-06 03:56:08,954 INFO L226 Difference]: Without dead ends: 285 [2025-02-06 03:56:08,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:56:08,955 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 606 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:08,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 700 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:56:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-06 03:56:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 175. [2025-02-06 03:56:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2025-02-06 03:56:08,987 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 138 [2025-02-06 03:56:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:08,987 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2025-02-06 03:56:08,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 03:56:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2025-02-06 03:56:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:56:08,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:08,988 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:56:08,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 762177664, now seen corresponding path program 1 times [2025-02-06 03:56:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420818935] [2025-02-06 03:56:08,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:09,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:56:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:56:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:09,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420818935] [2025-02-06 03:56:09,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420818935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:09,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:09,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192568387] [2025-02-06 03:56:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:09,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:09,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:09,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:09,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:09,491 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:10,047 INFO L93 Difference]: Finished difference Result 370 states and 524 transitions. [2025-02-06 03:56:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-02-06 03:56:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:10,049 INFO L225 Difference]: With dead ends: 370 [2025-02-06 03:56:10,049 INFO L226 Difference]: Without dead ends: 272 [2025-02-06 03:56:10,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:10,050 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 109 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:10,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 643 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-06 03:56:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 186. [2025-02-06 03:56:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 149 states have (on average 1.3221476510067114) internal successors, (197), 149 states have internal predecessors, (197), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 265 transitions. [2025-02-06 03:56:10,062 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 265 transitions. Word has length 138 [2025-02-06 03:56:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:10,062 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 265 transitions. [2025-02-06 03:56:10,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 265 transitions. [2025-02-06 03:56:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:56:10,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:10,063 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:10,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:56:10,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:10,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash 251643487, now seen corresponding path program 1 times [2025-02-06 03:56:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331452157] [2025-02-06 03:56:10,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:10,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:56:10,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:56:10,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:10,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:11,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:11,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331452157] [2025-02-06 03:56:11,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331452157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:11,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:11,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:56:11,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498843521] [2025-02-06 03:56:11,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:11,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:56:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:11,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:56:11,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:11,208 INFO L87 Difference]: Start difference. First operand 186 states and 265 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:11,734 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2025-02-06 03:56:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2025-02-06 03:56:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:11,735 INFO L225 Difference]: With dead ends: 349 [2025-02-06 03:56:11,736 INFO L226 Difference]: Without dead ends: 240 [2025-02-06 03:56:11,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:56:11,736 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:11,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 665 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-06 03:56:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 139. [2025-02-06 03:56:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2025-02-06 03:56:11,743 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 138 [2025-02-06 03:56:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:11,743 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2025-02-06 03:56:11,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2025-02-06 03:56:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:56:11,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:11,744 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:11,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:56:11,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:11,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1504635949, now seen corresponding path program 1 times [2025-02-06 03:56:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:11,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599807200] [2025-02-06 03:56:11,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:11,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:56:11,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:56:11,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:11,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599807200] [2025-02-06 03:56:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599807200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:11,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616296833] [2025-02-06 03:56:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:11,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:11,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:11,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:11,924 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:12,124 INFO L93 Difference]: Finished difference Result 369 states and 528 transitions. [2025-02-06 03:56:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:56:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:12,126 INFO L225 Difference]: With dead ends: 369 [2025-02-06 03:56:12,126 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 03:56:12,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:56:12,127 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 111 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:12,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 451 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 03:56:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 139. [2025-02-06 03:56:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 199 transitions. [2025-02-06 03:56:12,138 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 199 transitions. Word has length 139 [2025-02-06 03:56:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:12,138 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 199 transitions. [2025-02-06 03:56:12,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 199 transitions. [2025-02-06 03:56:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:56:12,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:12,139 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:56:12,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:12,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash -533420340, now seen corresponding path program 1 times [2025-02-06 03:56:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125251217] [2025-02-06 03:56:12,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:12,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:56:12,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:56:12,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:56:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536219035] [2025-02-06 03:56:12,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:12,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:12,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:12,218 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:56:12,219 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:56:12,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:56:13,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:56:13,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:13,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:56:13,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:56:13,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:56:13,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:56:13,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:13,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:56:13,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:56:13,803 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:56:13,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:56:13,817 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:56:14,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:14,008 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:14,057 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:56:14,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:56:14 BoogieIcfgContainer [2025-02-06 03:56:14,059 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:56:14,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:56:14,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:56:14,060 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:56:14,061 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:01" (3/4) ... [2025-02-06 03:56:14,062 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:56:14,063 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:56:14,063 INFO L158 Benchmark]: Toolchain (without parser) took 13109.72ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 123.8MB in the beginning and 516.2MB in the end (delta: -392.4MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2025-02-06 03:56:14,063 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:56:14,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.68ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 106.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:56:14,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.97ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 102.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:56:14,064 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:56:14,064 INFO L158 Benchmark]: IcfgBuilder took 503.93ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 68.9MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:56:14,064 INFO L158 Benchmark]: TraceAbstraction took 12303.91ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 68.5MB in the beginning and 516.4MB in the end (delta: -447.9MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-02-06 03:56:14,064 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 629.1MB. Free memory was 516.4MB in the beginning and 516.2MB in the end (delta: 132.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:56:14,065 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 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.68ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 106.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.97ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 102.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 503.93ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 68.9MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12303.91ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 68.5MB in the beginning and 516.4MB in the end (delta: -447.9MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 629.1MB. Free memory was 516.4MB in the beginning and 516.2MB in the end (delta: 132.2kB). 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 someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L55] signed long int last_1_WrapperStruct00_var_1_8 = -100; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_8=-100] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L113] EXPR WrapperStruct00.var_1_8 [L113] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L88] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_10 [L89] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_10 [L89] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L91] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L93] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L94] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L96] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L97] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L99] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] WrapperStruct00.var_1_19 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_19 [L107] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_19 [L107] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L108] WrapperStruct00.var_1_21 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] RET updateVariables() [L125] CALL step() [L59] EXPR WrapperStruct00.var_1_19 [L59] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L60] EXPR WrapperStruct00.var_1_21 [L60] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L61] EXPR WrapperStruct00.var_1_18 [L61] EXPR WrapperStruct00.var_1_10 [L61] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L61] COND FALSE !((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) [L64] EXPR WrapperStruct00.var_1_18 [L64] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L64] COND FALSE !(WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) [L67] EXPR WrapperStruct00.var_1_20 [L67] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_20 [L70] EXPR WrapperStruct00.var_1_8 [L70] EXPR WrapperStruct00.var_1_20 [L70] EXPR WrapperStruct00.var_1_8 [L70] signed long int stepLocal_0 = (WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8; [L71] EXPR WrapperStruct00.var_1_20 [L71] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-970299] [L71] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) [L71] EXPR WrapperStruct00.var_1_8 [L71] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-970299] [L71] COND TRUE stepLocal_0 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8))) [L72] EXPR WrapperStruct00.var_1_7 [L72] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_1 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15 [L76] EXPR WrapperStruct00.var_1_15 [L76] (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L76] COND FALSE !((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) [L81] EXPR WrapperStruct00.var_1_17 [L81] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_17 [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) [L116] EXPR WrapperStruct00.var_1_1 [L116] EXPR WrapperStruct00.var_1_7 [L116] EXPR (((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20)))) [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_10 [L116] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))) [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR WrapperStruct00.var_1_7 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR ((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((signed char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116-L117] return (((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((signed char) WrapperStruct00.var_1_21)) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 918 mSDsluCounter, 4561 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3218 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2101 IncrementalHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 1343 mSDtfsCounter, 2101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 393 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1783 NumberOfCodeBlocks, 1783 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1494 ConstructedInterpolants, 0 QuantifiedInterpolants, 3289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 5952/5984 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:56:14,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.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 aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:56:15,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:56:15,954 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:56:15,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:56:15,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:56:15,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:56:15,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:56:15,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:56:15,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:56:15,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:56:15,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:56:15,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:56:15,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:56:15,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:56:15,976 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:56:15,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:56:15,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:56:15,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:56:15,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:56:15,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:56:15,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:56:15,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:56:15,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:56:15,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:56:15,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:15,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:56:15,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:56:15,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:56:15,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:56:15,979 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:56:15,979 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:56:15,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:56:15,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:56:15,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:56:15,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:56:15,979 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 -> aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc [2025-02-06 03:56:16,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:56:16,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:56:16,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:56:16,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:56:16,213 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:56:16,214 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-75.i [2025-02-06 03:56:17,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a2ade017/2c9b345485aa40a4ad6d960d38567bb1/FLAG9414430ed [2025-02-06 03:56:17,578 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:56:17,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i [2025-02-06 03:56:17,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a2ade017/2c9b345485aa40a4ad6d960d38567bb1/FLAG9414430ed [2025-02-06 03:56:17,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a2ade017/2c9b345485aa40a4ad6d960d38567bb1 [2025-02-06 03:56:17,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:56:17,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:56:17,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:17,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:56:17,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:56:17,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:17" (1/1) ... [2025-02-06 03:56:17,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a624fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:17, skipping insertion in model container [2025-02-06 03:56:17,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:17" (1/1) ... [2025-02-06 03:56:17,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:56:18,049 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-75.i[916,929] [2025-02-06 03:56:18,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:18,090 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:56:18,098 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-75.i[916,929] [2025-02-06 03:56:18,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:18,151 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:56:18,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18 WrapperNode [2025-02-06 03:56:18,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:18,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:18,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:56:18,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:56:18,158 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:56:18" (1/1) ... [2025-02-06 03:56:18,172 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:56:18" (1/1) ... [2025-02-06 03:56:18,201 INFO L138 Inliner]: procedures = 37, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2025-02-06 03:56:18,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:18,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:56:18,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:56:18,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:56:18,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,233 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-02-06 03:56:18,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:56:18,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:56:18,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:56:18,278 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:56:18,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (1/1) ... [2025-02-06 03:56:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:18,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:18,306 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:56:18,311 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:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:56:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:56:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:56:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:56:18,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:56:18,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:56:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:56:18,447 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:56:18,448 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:56:38,384 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-02-06 03:56:38,421 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-02-06 03:56:38,421 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:56:38,431 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:56:38,431 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:56:38,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:38 BoogieIcfgContainer [2025-02-06 03:56:38,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:56:38,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:56:38,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:56:38,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:56:38,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:56:17" (1/3) ... [2025-02-06 03:56:38,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79485184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:38, skipping insertion in model container [2025-02-06 03:56:38,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:18" (2/3) ... [2025-02-06 03:56:38,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79485184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:38, skipping insertion in model container [2025-02-06 03:56:38,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:38" (3/3) ... [2025-02-06 03:56:38,438 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-75.i [2025-02-06 03:56:38,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:56:38,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-75.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:56:38,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:56:38,484 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;@6a1d784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:56:38,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:56:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:38,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:38,497 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:38,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:38,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash 507046982, now seen corresponding path program 1 times [2025-02-06 03:56:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:56:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646563941] [2025-02-06 03:56:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:38,511 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:56:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:56:38,514 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:56:38,516 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:56:38,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:39,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:39,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:39,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:39,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:56:39,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-06 03:56:39,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:39,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:56:39,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646563941] [2025-02-06 03:56:39,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646563941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:39,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:39,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:56:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437560178] [2025-02-06 03:56:39,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:39,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:56:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:56:39,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:56:39,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:56:39,917 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:39,934 INFO L93 Difference]: Finished difference Result 186 states and 292 transitions. [2025-02-06 03:56:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:56:39,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-02-06 03:56:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:39,939 INFO L225 Difference]: With dead ends: 186 [2025-02-06 03:56:39,939 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:56:39,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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:56:39,944 INFO L435 NwaCegarLoop]: 135 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, 135 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:56:39,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:56:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 03:56:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-02-06 03:56:39,973 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2025-02-06 03:56:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:39,973 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-02-06 03:56:39,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:56:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-02-06 03:56:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:39,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:39,975 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:40,003 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 (2)] Ended with exit code 0 [2025-02-06 03:56:40,175 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:56:40,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:40,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1528716033, now seen corresponding path program 1 times [2025-02-06 03:56:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:56:40,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138590854] [2025-02-06 03:56:40,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:40,177 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:56:40,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:56:40,179 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:56:40,179 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:56:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:41,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:41,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:41,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:41,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:56:41,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:42,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:42,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:56:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138590854] [2025-02-06 03:56:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138590854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:42,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:42,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024325408] [2025-02-06 03:56:42,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:42,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:56:42,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:42,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:42,056 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:42,864 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2025-02-06 03:56:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:56:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:42,867 INFO L225 Difference]: With dead ends: 188 [2025-02-06 03:56:42,868 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:56:42,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:42,869 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:42,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:56:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:56:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-02-06 03:56:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-02-06 03:56:42,878 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 136 [2025-02-06 03:56:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:42,880 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-02-06 03:56:42,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-02-06 03:56:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:42,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:42,881 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:42,915 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:56:43,081 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:56:43,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:43,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash -641212352, now seen corresponding path program 1 times [2025-02-06 03:56:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:56:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412131114] [2025-02-06 03:56:43,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:43,083 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:56:43,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:56:43,087 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:56:43,087 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:56:43,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:44,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:44,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:44,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:56:44,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:56:45,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:45,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:56:45,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412131114] [2025-02-06 03:56:45,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412131114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:45,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:45,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068918703] [2025-02-06 03:56:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:45,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:56:45,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:45,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:45,253 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:46,373 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-02-06 03:56:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:46,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:56:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:46,375 INFO L225 Difference]: With dead ends: 194 [2025-02-06 03:56:46,375 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:56:46,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:46,380 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:46,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 624 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:56:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:56:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-06 03:56:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:56:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-02-06 03:56:46,391 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2025-02-06 03:56:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:46,391 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-02-06 03:56:46,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:56:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-02-06 03:56:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:56:46,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:46,392 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:46,430 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 (4)] Ended with exit code 0 [2025-02-06 03:56:46,593 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:56:46,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -640288831, now seen corresponding path program 1 times [2025-02-06 03:56:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:56:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108536289] [2025-02-06 03:56:46,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:46,594 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:56:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:56:46,596 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:56:46,598 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:56:46,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:56:48,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:56:48,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:48,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:48,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 03:56:48,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:48,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 90 [2025-02-06 03:56:49,508 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 132 treesize of output 119 [2025-02-06 03:56:51,536 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 134 treesize of output 123 [2025-02-06 03:56:53,926 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 128 treesize of output 117 [2025-02-06 03:56:55,953 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 128 treesize of output 115 [2025-02-06 03:56:58,197 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 128 treesize of output 115 [2025-02-06 03:57:01,746 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 133 treesize of output 120 [2025-02-06 03:57:10,017 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 138 treesize of output 123 [2025-02-06 03:57:23,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 143 treesize of output 126