./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.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-sp_file-24.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 eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:01:27,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:01:27,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:01:27,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:01:27,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:01:27,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:01:27,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:01:27,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:01:27,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:01:27,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:01:27,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:01:27,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:01:27,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:01:27,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:01:27,862 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:01:27,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:01:27,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:01:27,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:01:27,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:01:27,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:01:27,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:01:27,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:01:27,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:01:27,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:01:27,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:01:27,865 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 -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2025-02-06 04:01:28,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:01:28,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:01:28,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:01:28,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:01:28,111 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:01:28,112 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-sp_file-24.i [2025-02-06 04:01:29,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6ee9c1eb/651cb94e6f4d4cb5b78114053bcf8281/FLAGca6df5271 [2025-02-06 04:01:29,500 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:01:29,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2025-02-06 04:01:29,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6ee9c1eb/651cb94e6f4d4cb5b78114053bcf8281/FLAGca6df5271 [2025-02-06 04:01:29,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6ee9c1eb/651cb94e6f4d4cb5b78114053bcf8281 [2025-02-06 04:01:29,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:01:29,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:01:29,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:01:29,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:01:29,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:01:29,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29, skipping insertion in model container [2025-02-06 04:01:29,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:01:29,672 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-sp_file-24.i[917,930] [2025-02-06 04:01:29,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:01:29,738 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:01:29,745 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-sp_file-24.i[917,930] [2025-02-06 04:01:29,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:01:29,784 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:01:29,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29 WrapperNode [2025-02-06 04:01:29,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:01:29,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:01:29,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:01:29,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:01:29,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,826 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2025-02-06 04:01:29,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:01:29,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:01:29,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:01:29,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:01:29,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,843 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:01:29,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:01:29,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:01:29,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:01:29,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:01:29,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (1/1) ... [2025-02-06 04:01:29,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:01:29,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:29,900 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 04:01:29,909 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 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:01:29,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:01:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:01:29,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:01:30,020 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:01:30,021 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:01:30,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem73#1;havoc property_#t~mem72#1;havoc property_#t~short74#1;havoc property_#t~ite96#1;havoc property_#t~mem75#1;havoc property_#t~ite93#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem90#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~short112#1;havoc property_#t~mem113#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1; [2025-02-06 04:01:30,420 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-02-06 04:01:30,420 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:01:30,433 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:01:30,433 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:01:30,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:30 BoogieIcfgContainer [2025-02-06 04:01:30,434 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:01:30,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:01:30,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:01:30,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:01:30,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:01:29" (1/3) ... [2025-02-06 04:01:30,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3131be23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:01:30, skipping insertion in model container [2025-02-06 04:01:30,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:29" (2/3) ... [2025-02-06 04:01:30,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3131be23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:01:30, skipping insertion in model container [2025-02-06 04:01:30,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:30" (3/3) ... [2025-02-06 04:01:30,443 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2025-02-06 04:01:30,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:01:30,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-24.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:01:30,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:01:30,508 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;@69ddf86c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:01:30,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:01:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:01:30,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:30,523 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:30,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:30,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash -503041458, now seen corresponding path program 1 times [2025-02-06 04:01:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-02-06 04:01:30,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:30,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:01:30,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:01:30,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:30,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 04:01:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-02-06 04:01:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717929570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146025567] [2025-02-06 04:01:30,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:30,879 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 04:01:30,881 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 04:01:31,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:01:31,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:01:31,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:31,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:31,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:01:31,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 04:01:31,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:01:31,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146025567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:31,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:01:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:01:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554719151] [2025-02-06 04:01:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:31,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:01:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:31,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:01:31,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:01:31,147 INFO L87 Difference]: Start difference. First operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:01:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:31,164 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2025-02-06 04:01:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:01:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-02-06 04:01:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:31,169 INFO L225 Difference]: With dead ends: 194 [2025-02-06 04:01:31,171 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 04:01:31,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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 04:01:31,179 INFO L435 NwaCegarLoop]: 139 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, 139 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 04:01:31,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 04:01:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 04:01:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-02-06 04:01:31,207 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2025-02-06 04:01:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:31,208 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-02-06 04:01:31,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:01:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-02-06 04:01:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:01:31,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:31,210 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:31,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:01:31,410 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 04:01:31,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:31,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 981754683, now seen corresponding path program 1 times [2025-02-06 04:01:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895996269] [2025-02-06 04:01:31,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:31,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:01:31,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:01:31,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:31,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895996269] [2025-02-06 04:01:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895996269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:01:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490602829] [2025-02-06 04:01:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:01:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:01:31,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:01:31,667 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:31,699 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-02-06 04:01:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:01:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 04:01:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:31,701 INFO L225 Difference]: With dead ends: 192 [2025-02-06 04:01:31,701 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 04:01:31,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:01:31,702 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:31,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 04:01:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 04:01:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-02-06 04:01:31,720 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2025-02-06 04:01:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:31,724 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-02-06 04:01:31,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-02-06 04:01:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:01:31,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:31,726 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:01:31,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash -263009798, now seen corresponding path program 1 times [2025-02-06 04:01:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503189846] [2025-02-06 04:01:31,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:31,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:01:31,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:01:31,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:31,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:31,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:31,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503189846] [2025-02-06 04:01:31,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503189846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:31,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:31,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:01:31,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665846966] [2025-02-06 04:01:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:31,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:01:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:31,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:01:31,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:01:31,984 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:32,024 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-02-06 04:01:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:01:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 04:01:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:32,029 INFO L225 Difference]: With dead ends: 196 [2025-02-06 04:01:32,029 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 04:01:32,029 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 04:01:32,030 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 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 04:01:32,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 04:01:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-02-06 04:01:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-02-06 04:01:32,041 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2025-02-06 04:01:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:32,042 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-02-06 04:01:32,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-02-06 04:01:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:01:32,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:32,046 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:01:32,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:32,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2070464261, now seen corresponding path program 1 times [2025-02-06 04:01:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:32,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257085334] [2025-02-06 04:01:32,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:32,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:01:32,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:01:32,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:32,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257085334] [2025-02-06 04:01:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257085334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:32,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:01:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254277477] [2025-02-06 04:01:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:01:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:32,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:01:32,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:01:32,185 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:32,205 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2025-02-06 04:01:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:01:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 04:01:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:32,208 INFO L225 Difference]: With dead ends: 200 [2025-02-06 04:01:32,208 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 04:01:32,209 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 04:01:32,209 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:32,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 04:01:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-02-06 04:01:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-02-06 04:01:32,221 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 124 [2025-02-06 04:01:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:32,222 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-02-06 04:01:32,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-02-06 04:01:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:01:32,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:32,223 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:32,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:01:32,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:32,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1182960580, now seen corresponding path program 1 times [2025-02-06 04:01:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:32,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-02-06 04:01:32,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:32,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:01:32,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:01:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-02-06 04:01:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988825678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:01:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917843251] [2025-02-06 04:01:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:32,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:01:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:32,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:01:32,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:01:32,394 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:32,416 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2025-02-06 04:01:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:01:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 04:01:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:32,418 INFO L225 Difference]: With dead ends: 204 [2025-02-06 04:01:32,418 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 04:01:32,419 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 04:01:32,420 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 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 04:01:32,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 04:01:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-02-06 04:01:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-02-06 04:01:32,431 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 124 [2025-02-06 04:01:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:32,432 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-02-06 04:01:32,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-02-06 04:01:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:01:32,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:32,435 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:32,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:01:32,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:32,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1182037059, now seen corresponding path program 1 times [2025-02-06 04:01:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256505246] [2025-02-06 04:01:32,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:32,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:01:32,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:01:32,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:32,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256505246] [2025-02-06 04:01:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256505246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:33,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:01:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880758303] [2025-02-06 04:01:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:33,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:01:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:33,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:01:33,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:01:33,015 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:33,317 INFO L93 Difference]: Finished difference Result 256 states and 359 transitions. [2025-02-06 04:01:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:01:33,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 04:01:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:33,319 INFO L225 Difference]: With dead ends: 256 [2025-02-06 04:01:33,319 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 04:01:33,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:33,321 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:33,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 420 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:01:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 04:01:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 113. [2025-02-06 04:01:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-02-06 04:01:33,336 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 124 [2025-02-06 04:01:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:33,337 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-02-06 04:01:33,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-02-06 04:01:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 04:01:33,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:33,339 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:33,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:01:33,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:33,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1619261601, now seen corresponding path program 1 times [2025-02-06 04:01:33,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:33,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080379987] [2025-02-06 04:01:33,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:33,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 04:01:33,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 04:01:33,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:33,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:33,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080379987] [2025-02-06 04:01:33,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080379987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:33,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:33,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:01:33,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622609330] [2025-02-06 04:01:33,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:33,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:01:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:33,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:01:33,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:01:33,955 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:01:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:34,514 INFO L93 Difference]: Finished difference Result 281 states and 397 transitions. [2025-02-06 04:01:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:01:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2025-02-06 04:01:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:34,517 INFO L225 Difference]: With dead ends: 281 [2025-02-06 04:01:34,517 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 04:01:34,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:01:34,518 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 266 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:34,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 400 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:01:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 04:01:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 127. [2025-02-06 04:01:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2025-02-06 04:01:34,527 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 125 [2025-02-06 04:01:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:34,527 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2025-02-06 04:01:34,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:01:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2025-02-06 04:01:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 04:01:34,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:34,528 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:34,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:01:34,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:34,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1552254848, now seen corresponding path program 1 times [2025-02-06 04:01:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:34,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679513963] [2025-02-06 04:01:34,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:34,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 04:01:34,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 04:01:34,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:34,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:34,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:34,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679513963] [2025-02-06 04:01:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679513963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:34,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:34,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:01:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869251195] [2025-02-06 04:01:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:34,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:01:34,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:34,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:01:34,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:01:34,792 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:34,890 INFO L93 Difference]: Finished difference Result 253 states and 357 transitions. [2025-02-06 04:01:34,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:01:34,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 04:01:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:34,891 INFO L225 Difference]: With dead ends: 253 [2025-02-06 04:01:34,891 INFO L226 Difference]: Without dead ends: 129 [2025-02-06 04:01:34,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:01:34,892 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:34,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:01:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-06 04:01:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-02-06 04:01:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2025-02-06 04:01:34,901 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 125 [2025-02-06 04:01:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:34,901 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2025-02-06 04:01:34,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2025-02-06 04:01:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 04:01:34,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:34,902 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:01:34,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash -652479425, now seen corresponding path program 1 times [2025-02-06 04:01:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594460116] [2025-02-06 04:01:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:34,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 04:01:34,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 04:01:34,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:34,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:35,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:35,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594460116] [2025-02-06 04:01:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594460116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:35,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:01:35,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277638221] [2025-02-06 04:01:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:35,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:01:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:35,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:01:35,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:01:35,506 INFO L87 Difference]: Start difference. First operand 127 states and 178 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:01:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:35,853 INFO L93 Difference]: Finished difference Result 299 states and 418 transitions. [2025-02-06 04:01:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:01:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-02-06 04:01:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:35,855 INFO L225 Difference]: With dead ends: 299 [2025-02-06 04:01:35,855 INFO L226 Difference]: Without dead ends: 175 [2025-02-06 04:01:35,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:01:35,856 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 414 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:35,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 306 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:01:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-06 04:01:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 129. [2025-02-06 04:01:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2025-02-06 04:01:35,868 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 126 [2025-02-06 04:01:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:35,869 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2025-02-06 04:01:35,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:01:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2025-02-06 04:01:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 04:01:35,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:35,870 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:35,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:01:35,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:35,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1870708965, now seen corresponding path program 1 times [2025-02-06 04:01:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:35,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160024850] [2025-02-06 04:01:35,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:35,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 04:01:35,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 04:01:35,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:35,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:36,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160024850] [2025-02-06 04:01:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160024850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:01:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901382126] [2025-02-06 04:01:36,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:36,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:01:36,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:36,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:01:36,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:01:36,073 INFO L87 Difference]: Start difference. First operand 129 states and 181 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:36,189 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2025-02-06 04:01:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:01:36,190 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-02-06 04:01:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:36,191 INFO L225 Difference]: With dead ends: 295 [2025-02-06 04:01:36,191 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 04:01:36,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:01:36,192 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 99 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:36,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 353 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:01:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 04:01:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 130. [2025-02-06 04:01:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 113 states have (on average 1.345132743362832) internal successors, (152), 113 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2025-02-06 04:01:36,203 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 126 [2025-02-06 04:01:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:36,203 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2025-02-06 04:01:36,203 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2025-02-06 04:01:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 04:01:36,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:36,204 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:36,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:01:36,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:36,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1427185978, now seen corresponding path program 1 times [2025-02-06 04:01:36,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:36,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656791026] [2025-02-06 04:01:36,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:36,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:36,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 04:01:36,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 04:01:36,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:36,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:36,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:36,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656791026] [2025-02-06 04:01:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656791026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:36,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:01:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813516165] [2025-02-06 04:01:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:36,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:01:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:36,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:01:36,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:01:36,585 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:36,821 INFO L93 Difference]: Finished difference Result 307 states and 428 transitions. [2025-02-06 04:01:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:01:36,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-02-06 04:01:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:36,822 INFO L225 Difference]: With dead ends: 307 [2025-02-06 04:01:36,822 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 04:01:36,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:36,823 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 302 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:36,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 345 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:01:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 04:01:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2025-02-06 04:01:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2025-02-06 04:01:36,835 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 126 [2025-02-06 04:01:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:36,837 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2025-02-06 04:01:36,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2025-02-06 04:01:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 04:01:36,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:36,838 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:36,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:01:36,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:36,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash 81530721, now seen corresponding path program 1 times [2025-02-06 04:01:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688139013] [2025-02-06 04:01:36,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:36,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:01:36,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:01:36,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:36,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:37,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:37,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688139013] [2025-02-06 04:01:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688139013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:01:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923103633] [2025-02-06 04:01:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:37,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:01:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:37,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:01:37,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:01:37,355 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:37,718 INFO L93 Difference]: Finished difference Result 310 states and 429 transitions. [2025-02-06 04:01:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:01:37,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-02-06 04:01:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:37,720 INFO L225 Difference]: With dead ends: 310 [2025-02-06 04:01:37,720 INFO L226 Difference]: Without dead ends: 179 [2025-02-06 04:01:37,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:37,720 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 315 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:37,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 349 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:01:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-06 04:01:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 136. [2025-02-06 04:01:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2025-02-06 04:01:37,736 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 127 [2025-02-06 04:01:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:37,736 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2025-02-06 04:01:37,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2025-02-06 04:01:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 04:01:37,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:37,737 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:37,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:01:37,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:37,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:37,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2133771172, now seen corresponding path program 1 times [2025-02-06 04:01:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815479497] [2025-02-06 04:01:37,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:37,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 04:01:37,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 04:01:37,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:37,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815479497] [2025-02-06 04:01:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815479497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:38,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:01:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928335295] [2025-02-06 04:01:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:38,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:01:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:38,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:01:38,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:01:38,505 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:38,915 INFO L93 Difference]: Finished difference Result 321 states and 444 transitions. [2025-02-06 04:01:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:01:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-02-06 04:01:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:38,917 INFO L225 Difference]: With dead ends: 321 [2025-02-06 04:01:38,917 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 04:01:38,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:01:38,918 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 152 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:38,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 607 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:01:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 04:01:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2025-02-06 04:01:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.3359375) internal successors, (171), 128 states have internal predecessors, (171), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2025-02-06 04:01:38,931 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 127 [2025-02-06 04:01:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:38,931 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2025-02-06 04:01:38,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2025-02-06 04:01:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:01:38,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:38,932 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:38,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:01:38,933 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:38,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash -769035972, now seen corresponding path program 1 times [2025-02-06 04:01:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:38,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418240793] [2025-02-06 04:01:38,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:38,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:01:39,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:01:39,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:39,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:40,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418240793] [2025-02-06 04:01:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418240793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:40,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:40,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:01:40,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454074793] [2025-02-06 04:01:40,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:40,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:01:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:40,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:01:40,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:01:40,192 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 04:01:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:40,746 INFO L93 Difference]: Finished difference Result 328 states and 452 transitions. [2025-02-06 04:01:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:01:40,746 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), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2025-02-06 04:01:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:40,748 INFO L225 Difference]: With dead ends: 328 [2025-02-06 04:01:40,748 INFO L226 Difference]: Without dead ends: 186 [2025-02-06 04:01:40,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:01:40,749 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 352 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:40,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 240 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:01:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-06 04:01:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2025-02-06 04:01:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 124 states have internal predecessors, (165), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2025-02-06 04:01:40,761 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 128 [2025-02-06 04:01:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:40,762 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2025-02-06 04:01:40,762 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), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 04:01:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2025-02-06 04:01:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:01:40,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:40,764 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:40,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:01:40,764 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:40,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 463849718, now seen corresponding path program 1 times [2025-02-06 04:01:40,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:40,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284798582] [2025-02-06 04:01:40,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:01:40,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:01:40,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:40,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 04:01:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284798582] [2025-02-06 04:01:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284798582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38844655] [2025-02-06 04:01:40,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:40,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:40,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:40,881 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 04:01:40,883 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 04:01:41,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:01:41,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:01:41,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:41,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:01:41,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:01:41,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:01:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38844655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:41,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:01:41,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 04:01:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408432302] [2025-02-06 04:01:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:01:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:41,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:01:41,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:01:41,136 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:41,163 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2025-02-06 04:01:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:01:41,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-02-06 04:01:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:41,165 INFO L225 Difference]: With dead ends: 282 [2025-02-06 04:01:41,165 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 04:01:41,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:01:41,167 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:41,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 04:01:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-06 04:01:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 127 states have internal predecessors, (168), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:01:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2025-02-06 04:01:41,179 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 128 [2025-02-06 04:01:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:41,179 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2025-02-06 04:01:41,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 04:01:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2025-02-06 04:01:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:01:41,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:41,181 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:41,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:01:41,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 04:01:41,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:41,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash 240077790, now seen corresponding path program 1 times [2025-02-06 04:01:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116565962] [2025-02-06 04:01:41,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:41,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:01:41,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:01:41,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:41,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 04:01:45,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:45,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116565962] [2025-02-06 04:01:45,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116565962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:45,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310511623] [2025-02-06 04:01:45,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:45,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:45,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:45,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:01:45,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:01:46,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:01:46,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:01:46,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:46,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:46,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-06 04:01:46,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:47,023 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 15 treesize of output 1 [2025-02-06 04:01:47,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:01:47,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:01:48,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:01:49,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:01:49,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:01:49,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:49,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:49,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:01:50,060 INFO L349 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2025-02-06 04:01:50,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 87 [2025-02-06 04:01:50,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,232 INFO L349 Elim1Store]: treesize reduction 371, result has 13.9 percent of original size [2025-02-06 04:01:50,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 289 treesize of output 397 [2025-02-06 04:01:50,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:50,480 INFO L349 Elim1Store]: treesize reduction 89, result has 16.0 percent of original size [2025-02-06 04:01:50,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 109 treesize of output 152 [2025-02-06 04:01:52,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,182 INFO L349 Elim1Store]: treesize reduction 279, result has 15.5 percent of original size [2025-02-06 04:01:52,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 157 treesize of output 248 [2025-02-06 04:01:52,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,309 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:01:52,331 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-02-06 04:01:52,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 92 [2025-02-06 04:01:52,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,454 INFO L349 Elim1Store]: treesize reduction 225, result has 11.1 percent of original size [2025-02-06 04:01:52,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 116 treesize of output 121 [2025-02-06 04:01:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,516 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:01:52,524 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:01:52,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 75 [2025-02-06 04:01:52,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:52,553 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:01:52,578 INFO L349 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2025-02-06 04:01:52,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 92 [2025-02-06 04:01:54,120 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 892 treesize of output 719 [2025-02-06 04:01:54,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 33 [2025-02-06 04:01:54,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,247 INFO L349 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2025-02-06 04:01:54,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 476 treesize of output 404 [2025-02-06 04:01:54,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:54,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 69 [2025-02-06 04:01:59,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:59,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:59,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:59,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:01:59,643 INFO L349 Elim1Store]: treesize reduction 200, result has 19.0 percent of original size [2025-02-06 04:01:59,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 210 treesize of output 317 [2025-02-06 04:02:00,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,842 INFO L349 Elim1Store]: treesize reduction 151, result has 20.1 percent of original size [2025-02-06 04:02:00,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 114 treesize of output 196 [2025-02-06 04:02:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,882 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2025-02-06 04:02:00,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 85 [2025-02-06 04:02:00,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:00,946 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:02:00,947 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:02:00,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 82 [2025-02-06 04:02:02,087 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 102 treesize of output 78 [2025-02-06 04:02:02,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:02,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:02,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:02,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:02,094 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-06 04:02:02,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 57 [2025-02-06 04:02:15,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:15,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:15,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:02:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 242 proven. 95 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-06 04:02:16,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:02:16,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_4_Pointer~0.offset Int) (~WrapperStruct00_var_1_4_Pointer~0.base Int) (v_ArrVal_1841 Int) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1839 (store (select (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select (select |c_#memory_int| c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1839 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< 23179 (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1836) c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1839))) (store .cse2 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset (select (select .cse2 ~WrapperStruct00_var_1_4_Pointer~0.base) ~WrapperStruct00_var_1_4_Pointer~0.offset)))))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1841))))) (+ (mod (select (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset) 65536) (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)))))) is different from false [2025-02-06 04:02:16,433 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_4_Pointer~0.offset Int) (~WrapperStruct00_var_1_4_Pointer~0.base Int) (v_ArrVal_1841 Int) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1834 Int) (v_ArrVal_1836 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset v_ArrVal_1834)))) (or (not (= v_ArrVal_1839 (store (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1839 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< 23179 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1836) c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1839))) (store .cse3 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset (select (select .cse3 ~WrapperStruct00_var_1_4_Pointer~0.base) ~WrapperStruct00_var_1_4_Pointer~0.offset)))))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1841))))) (+ (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) (mod (select (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset) 65536))))))) is different from false [2025-02-06 04:02:16,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310511623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:16,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:02:16,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2025-02-06 04:02:16,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285219246] [2025-02-06 04:02:16,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:02:16,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 04:02:16,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:16,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 04:02:16,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=826, Unknown=3, NotChecked=122, Total=1122 [2025-02-06 04:02:16,486 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 29 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 29 states have internal predecessors, (112), 11 states have call successors, (30), 5 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 11 states have call successors, (30) [2025-02-06 04:02:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:19,203 INFO L93 Difference]: Finished difference Result 380 states and 506 transitions. [2025-02-06 04:02:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 04:02:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 29 states have internal predecessors, (112), 11 states have call successors, (30), 5 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 11 states have call successors, (30) Word has length 129 [2025-02-06 04:02:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:19,205 INFO L225 Difference]: With dead ends: 380 [2025-02-06 04:02:19,205 INFO L226 Difference]: Without dead ends: 239 [2025-02-06 04:02:19,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=528, Invalid=2027, Unknown=3, NotChecked=198, Total=2756 [2025-02-06 04:02:19,206 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 456 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:19,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 634 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 04:02:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-06 04:02:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2025-02-06 04:02:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 202 states have (on average 1.2673267326732673) internal successors, (256), 203 states have internal predecessors, (256), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 04:02:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 302 transitions. [2025-02-06 04:02:19,238 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 302 transitions. Word has length 129 [2025-02-06 04:02:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:19,238 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 302 transitions. [2025-02-06 04:02:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 29 states have internal predecessors, (112), 11 states have call successors, (30), 5 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 11 states have call successors, (30) [2025-02-06 04:02:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 302 transitions. [2025-02-06 04:02:19,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:02:19,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:19,240 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:19,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:02:19,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:19,440 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:19,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash 451428703, now seen corresponding path program 1 times [2025-02-06 04:02:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:19,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721495392] [2025-02-06 04:02:19,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:19,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:02:19,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:02:19,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:19,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:02:21,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:21,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721495392] [2025-02-06 04:02:21,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721495392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:21,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:21,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:02:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647744160] [2025-02-06 04:02:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:21,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:02:21,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:21,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:02:21,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:02:21,911 INFO L87 Difference]: Start difference. First operand 232 states and 302 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:02:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:22,670 INFO L93 Difference]: Finished difference Result 554 states and 721 transitions. [2025-02-06 04:02:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:02:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-02-06 04:02:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:22,673 INFO L225 Difference]: With dead ends: 554 [2025-02-06 04:02:22,673 INFO L226 Difference]: Without dead ends: 325 [2025-02-06 04:02:22,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:02:22,674 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 214 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:22,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 409 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:02:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-06 04:02:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 239. [2025-02-06 04:02:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 209 states have (on average 1.263157894736842) internal successors, (264), 210 states have internal predecessors, (264), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 04:02:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2025-02-06 04:02:22,703 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 129 [2025-02-06 04:02:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:22,703 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2025-02-06 04:02:22,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 04:02:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2025-02-06 04:02:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:02:22,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:22,706 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:22,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:02:22,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:22,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1483890308, now seen corresponding path program 1 times [2025-02-06 04:02:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:22,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961805758] [2025-02-06 04:02:22,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:22,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:02:22,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:02:22,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:22,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 04:02:23,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:23,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961805758] [2025-02-06 04:02:23,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961805758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:23,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477965037] [2025-02-06 04:02:23,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:23,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:23,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:23,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:02:23,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:02:23,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:02:23,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:02:23,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:23,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:23,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 04:02:23,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:25,089 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 15 treesize of output 1 [2025-02-06 04:02:25,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:25,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:26,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2025-02-06 04:02:26,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-02-06 04:02:26,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-02-06 04:02:26,181 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 60 treesize of output 49 [2025-02-06 04:02:26,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2025-02-06 04:02:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2025-02-06 04:02:26,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2025-02-06 04:02:26,241 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 64 treesize of output 53 [2025-02-06 04:02:26,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2025-02-06 04:02:26,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:26,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 04:02:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 153 proven. 65 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-02-06 04:02:26,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:02:26,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2141 Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2137 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_2141)))) (or (< 0 (mod (select (select (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_2138))) (store .cse0 c_~WrapperStruct00_var_1_19_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset v_ArrVal_2137))) c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset) 256)) (not (= v_ArrVal_2138 (store (select .cse1 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_2138 c_~WrapperStruct00_var_1_17_Pointer~0.offset))))))) is different from false [2025-02-06 04:02:26,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477965037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:26,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:02:26,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-02-06 04:02:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698483085] [2025-02-06 04:02:26,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:02:26,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:02:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:26,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:02:26,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=354, Unknown=2, NotChecked=38, Total=462 [2025-02-06 04:02:26,454 INFO L87 Difference]: Start difference. First operand 239 states and 310 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 19 states have internal predecessors, (101), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2025-02-06 04:02:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:28,058 INFO L93 Difference]: Finished difference Result 523 states and 673 transitions. [2025-02-06 04:02:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 04:02:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 19 states have internal predecessors, (101), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) Word has length 129 [2025-02-06 04:02:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:28,060 INFO L225 Difference]: With dead ends: 523 [2025-02-06 04:02:28,060 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 04:02:28,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=693, Unknown=2, NotChecked=56, Total=930 [2025-02-06 04:02:28,061 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 326 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:28,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 517 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 04:02:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 04:02:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 280. [2025-02-06 04:02:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 236 states have (on average 1.2330508474576272) internal successors, (291), 238 states have internal predecessors, (291), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 04:02:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 357 transitions. [2025-02-06 04:02:28,095 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 357 transitions. Word has length 129 [2025-02-06 04:02:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:28,095 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 357 transitions. [2025-02-06 04:02:28,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 19 states have internal predecessors, (101), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2025-02-06 04:02:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 357 transitions. [2025-02-06 04:02:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:02:28,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:28,096 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:28,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:02:28,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 04:02:28,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:28,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1472574181, now seen corresponding path program 1 times [2025-02-06 04:02:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526206806] [2025-02-06 04:02:28,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:28,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:02:28,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:02:28,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:28,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:02:28,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:02:28,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:02:28,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:02:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:02:28,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:02:28,486 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:02:28,486 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:02:28,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:02:28,492 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:28,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:02:28,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:02:28 BoogieIcfgContainer [2025-02-06 04:02:28,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:02:28,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:02:28,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:02:28,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:02:28,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:30" (3/4) ... [2025-02-06 04:02:28,625 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:02:28,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:02:28,626 INFO L158 Benchmark]: Toolchain (without parser) took 59090.42ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 123.5MB in the beginning and 303.5MB in the end (delta: -180.0MB). Peak memory consumption was 221.8MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,627 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:28,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.79ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:28,627 INFO L158 Benchmark]: Boogie Preprocessor took 30.05ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:28,627 INFO L158 Benchmark]: IcfgBuilder took 575.99ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 69.0MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,627 INFO L158 Benchmark]: TraceAbstraction took 58186.26ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 68.2MB in the beginning and 303.5MB in the end (delta: -235.2MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2025-02-06 04:02:28,627 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 570.4MB. Free memory is still 303.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:28,628 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.60ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.79ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.05ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 575.99ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 69.0MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 58186.26ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 68.2MB in the beginning and 303.5MB in the end (delta: -235.2MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 570.4MB. Free memory is still 303.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 0, 16, 4, 0, 0, 55182, 0, 1, 1, 100, 2.25, 199.4, -128 }; [L55] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] signed char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L103] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L115] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L72] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L75] (*(WrapperStruct00_var_1_12_Pointer)) = ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L77] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L80] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((*(WrapperStruct00_var_1_12_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_1_Pointer)) = (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))))) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] COND FALSE !(((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121-L122] return (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.0s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3134 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3115 mSDsluCounter, 7056 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4907 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5151 IncrementalHoareTripleChecker+Invalid, 5419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 2149 mSDtfsCounter, 5151 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 594 SyntacticMatches, 3 SemanticMatches, 174 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=18, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 453 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 45.7s InterpolantComputationTime, 2908 NumberOfCodeBlocks, 2908 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2757 ConstructedInterpolants, 0 QuantifiedInterpolants, 29830 SizeOfPredicates, 36 NumberOfNonLiveVariables, 2124 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 8980/9240 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 04:02:28,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.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 eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:02:30,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:02:30,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 04:02:30,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:02:30,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:02:30,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:02:30,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:02:30,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:02:30,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:02:30,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:02:30,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:02:30,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:02:30,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:02:30,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:30,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:02:30,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:02:30,601 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 -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2025-02-06 04:02:30,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:02:30,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:02:30,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:02:30,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:02:30,829 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:02:30,830 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-sp_file-24.i [2025-02-06 04:02:32,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/102a239a7/5c9ec4bde4f940f8a81219c2498ac7d6/FLAGcb4e42630 [2025-02-06 04:02:32,224 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:02:32,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2025-02-06 04:02:32,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/102a239a7/5c9ec4bde4f940f8a81219c2498ac7d6/FLAGcb4e42630 [2025-02-06 04:02:32,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/102a239a7/5c9ec4bde4f940f8a81219c2498ac7d6 [2025-02-06 04:02:32,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:02:32,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:02:32,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:32,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:02:32,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:02:32,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32, skipping insertion in model container [2025-02-06 04:02:32,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:02:32,382 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-sp_file-24.i[917,930] [2025-02-06 04:02:32,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:32,452 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:02:32,462 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-sp_file-24.i[917,930] [2025-02-06 04:02:32,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:32,527 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:02:32,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32 WrapperNode [2025-02-06 04:02:32,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:32,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:32,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:02:32,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:02:32,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,581 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2025-02-06 04:02:32,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:32,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:02:32,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:02:32,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:02:32,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,614 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-02-06 04:02:32,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:02:32,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:02:32,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:02:32,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:02:32,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (1/1) ... [2025-02-06 04:02:32,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:32,670 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 04:02:32,672 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 04:02:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:02:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:02:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:02:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:02:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:02:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:02:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:02:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:02:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:02:32,814 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:02:32,817 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:02:51,905 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem73#1;havoc property_#t~mem72#1;havoc property_#t~short74#1;havoc property_#t~ite96#1;havoc property_#t~mem75#1;havoc property_#t~ite93#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem90#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~short112#1;havoc property_#t~mem113#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1; [2025-02-06 04:02:51,957 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-02-06 04:02:51,957 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:02:51,966 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:02:51,966 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:02:51,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:51 BoogieIcfgContainer [2025-02-06 04:02:51,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:02:51,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:02:51,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:02:51,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:02:51,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:02:32" (1/3) ... [2025-02-06 04:02:51,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a7ecfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:51, skipping insertion in model container [2025-02-06 04:02:51,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:32" (2/3) ... [2025-02-06 04:02:51,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a7ecfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:51, skipping insertion in model container [2025-02-06 04:02:51,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:51" (3/3) ... [2025-02-06 04:02:51,974 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2025-02-06 04:02:51,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:02:51,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-24.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:02:52,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:02:52,025 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;@14e87477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:02:52,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:02:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 04:02:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 04:02:52,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:52,034 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:52,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:52,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1880348313, now seen corresponding path program 1 times [2025-02-06 04:02:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:02:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358930099] [2025-02-06 04:02:52,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:52,046 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 04:02:52,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:02:52,048 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 04:02:52,048 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 04:02:52,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 04:02:52,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 04:02:52,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:52,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:53,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:02:53,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 04:02:53,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:53,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:02:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358930099] [2025-02-06 04:02:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358930099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:02:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296421613] [2025-02-06 04:02:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton